1041 search results - page 53 / 209 » Randomizing Reductions of Search Problems |
BIOADIT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...
AAAI
1997
13 years 9 months ago
1997
In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Se...
EOR
2002
13 years 7 months ago
2002
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
ICRA
2007
IEEE
14 years 2 months ago
2007
IEEE
— Designing algorithms for multi-robot systems can be a complex and difficult process: the cost of such systems can be very high, collecting experimental data can be timeconsumi...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...