1529 search results - page 159 / 306 » Search Space Analysis of the Linear Ordering Problem |
132
click to vote
MONET
2008
15 years 4 months ago
2008
Genetic algorithms are best suited for optimization problems involving large search spaces. The problem space encountered when optimizing the transmission parameters of an agile or...
108
click to vote
CATS
2007
15 years 5 months ago
2007
The busy beaver problem is to find the maximum number of 1’s that can be printed by an n-state Turing machine of a particular type. A critical step in the evaluation of this va...
262
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Genetic algorithms are a population-based Meta heuristics. They have been successfully applied to many optimization problems. However, premature convergence is an inherent charact...
171
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
The Model Checking Integrated Planning System (MIPS) has shown distinguished performance in the second and third international planning competitions. With its object-oriented fram...
131
click to vote
CAV
2009
Springer
15 years 11 months ago
2009
Springer
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....