Sciweavers

820 search results - page 18 / 164
» A Search Algorithm for Global Optimisation
Sort
View
HASE
2007
IEEE
15 years 3 months ago
An Efficient Experimental Methodology for Configuring Search-Based Design Algorithms
Many problems in high assurance systems design are only tractable using computationally expensive search algorithms. For these algorithms to be useful, designers must be provided ...
Simon M. Poulding, Paul Emberson, Iain Bate, John ...
CEC
2010
IEEE
15 years 19 days ago
Iterated local search vs. hyper-heuristics: Towards general-purpose search algorithms
An important challenge within hyper-heuristic research is to design search methodologies that work well, not only across different instances of the same problem, but also across di...
Edmund K. Burke, Timothy Curtois, Matthew R. Hyde,...
ECAI
2004
Springer
15 years 4 months ago
Adversarial Constraint Satisfaction by Game-Tree Search
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
Kenneth N. Brown, James Little, Páidí...
GECCO
2008
Springer
171views Optimization» more  GECCO 2008»
15 years 18 days ago
An EDA based on local markov property and gibbs sampling
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....
Siddhartha Shakya, Roberto Santana
IEEEARES
2010
IEEE
15 years 3 months ago
Optimising IDS Sensor Placement
—In large network environments multiple intrusion detection sensors are needed to adequately monitor network traffic. However, deploying and managing additional sensors on a lar...
Hao Chen, John A. Clark, Siraj A. Shaikh, Howard C...