keywords:"Random Search" - Search Results - Digital Repository

guest :: login Digital Repository
		Search		Submit		Help		About

Home > Search Results: keywords:"Random Search"

Search:

Search Tips :: Advanced Search

Search collections:

Sort by:	Display results:	Output format:

	Evolutionary Algorithms for the Solution of Travelling Salesman Problem Jurčík, Lukáš ; Budík, Jan (referee) ; Dostál, Petr (advisor) This diploma thesis deals with evolutionary algorithms used for travelling salesman problem (TSP). In the first section, there are theoretical foundations of a graph theory and computational complexity theory. Next section contains a description of chosen optimization algorithms. The aim of the diploma thesis is to implement an application that solve TSP using evolutionary algorithms. Detailed record
	Automatic Grouping of Regular Expressions Stanek, Timotej ; Kořenek, Jan (referee) ; Kaštil, Jan (advisor) This project is about security of computer networks using Intrusion Detection Systems. IDS contain rules for detection expressed with regular expressions, which are for detection represented by finite-state automata. The complexity of this detection with non-deterministic and deterministic finite-state automata is explained. This complexity can be reduced with help of regular expressions grouping. Grouping algorithm and approaches for speedup and improvement are introduced. One of the approches is Genetic algorithm, which can work real-time. Finally Random search algorithm for grouping of regular expressions is presented. Experiment results with these approches are shown and compared between each other. Detailed record
	Automatic Grouping of Regular Expressions Stanek, Timotej ; Kořenek, Jan (referee) ; Kaštil, Jan (advisor) This project is about security of computer networks using Intrusion Detection Systems. IDS contain rules for detection expressed with regular expressions, which are for detection represented by finite-state automata. The complexity of this detection with non-deterministic and deterministic finite-state automata is explained. This complexity can be reduced with help of regular expressions grouping. Grouping algorithm and approaches for speedup and improvement are introduced. One of the approches is Genetic algorithm, which can work real-time. Finally Random search algorithm for grouping of regular expressions is presented. Experiment results with these approches are shown and compared between each other. Detailed record
	Evolutionary Algorithms for the Solution of Travelling Salesman Problem Jurčík, Lukáš ; Budík, Jan (referee) ; Dostál, Petr (advisor) This diploma thesis deals with evolutionary algorithms used for travelling salesman problem (TSP). In the first section, there are theoretical foundations of a graph theory and computational complexity theory. Next section contains a description of chosen optimization algorithms. The aim of the diploma thesis is to implement an application that solve TSP using evolutionary algorithms. Detailed record
	MCMC metody ve výpočetní statistice a ekonometrii Volf, Petr The paper recals the MCMC methods, namely the Gibbs algorithm, the Metropolis--Hastings algorithm and variants used for solution of optimization problems, namely the simulated annealing. The objective is to describe the schemes of the algorithms, to recall their theoretical foundation, and to show their use both in Bayes data analysis and in randomized optimization problem. Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.

Digital Repository :: :: :: ::
Powered by v1.1.2
Maintained by

This site is also available in the following languages:
Česky English