Sciweavers

944 search results - page 28 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
FLAIRS
2007
15 years 5 days ago
Random Subsets Support Learning a Mixture of Heuristics
Problem solvers, both human and machine, have at their disposal many heuristics that may support effective search. The efficacy of these heuristics, however, varies with the probl...
Smiljana Petrovic, Susan L. Epstein
IPPS
2010
IEEE
14 years 7 months ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
IPL
2008
131views more  IPL 2008»
14 years 9 months ago
Ant colony optimization with partial order reduction for discovering safety property violations in concurrent models
In this article we analyze the combination of ACOhg, a new metaheuristic algorithm, plus partial order reduction applied to the problem of finding safety property violations in co...
J. Francisco Chicano, Enrique Alba
AISB
1995
Springer
15 years 1 months ago
Specialised Recombinative Operators for Timetabling Problems
This paper discusses a series of recombination operators for the timetabling problem. These operators act upon a direct representation of the timetable and maintain the property of...
Edmund K. Burke, Dave Elliman, Rupert F. Weare
JAIR
2000
123views more  JAIR 2000»
14 years 9 months ago
Backbone Fragility and the Local Search Cost Peak
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
Josh Singer, Ian P. Gent, Alan Smaill