5316 search results - page 218 / 1064 » Which Search Problems Are Random |
181
click to vote
FOGA
2011
14 years 7 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
139
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
133
click to vote
JAR
2000
15 years 3 months ago
2000
We study the runtime distributions of backtrack procedures for propositional satisfiability and constraint satisfaction. Such procedures often exhibit a large variability in perfor...
113
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
— Addressing dynamic optimization problems has attracted a growing interest from the evolutionary algorithm community in recent years due to its importance in the applications of...
136
click to vote
CP
2004
Springer
15 years 9 months ago
2004
Springer
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...