Sciweavers

1639 search results - page 76 / 328
» Anytime Heuristic Search
Sort
View
CORR
2007
Springer
131views Education» more  CORR 2007»
15 years 16 days ago
How to use the Scuba Diving metaphor to solve problem with neutrality ?
Abstract. We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality which exists in ...
Philippe Collard, Sébastien Vérel, M...
HEURISTICS
2002
99views more  HEURISTICS 2002»
15 years 10 days ago
Parallelizing Tabu Search on a Cluster of Heterogeneous Workstations
In this paper, we present the parallelization of tabu search on a network of workstations using PVM. Two parallelization strategies are integrated: functional decomposition strate...
Ahmad A. Al-Yamani, Sadiq M. Sait, Habib Youssef, ...
89
Voted
IPPS
2000
IEEE
15 years 5 months ago
A Parallel Co-evolutionary Metaheuristic
In order to show that the parallel co-evolution of di erent heuristic methods may lead to an e cient search strategy, we have hybridized three heuristic agents of complementary beh...
Vincent Bachelet, El-Ghazali Talbi
84
Voted
GECCO
2006
Springer
153views Optimization» more  GECCO 2006»
15 years 4 months ago
On the local performance of simulated annealing and the (1+1) evolutionary algorithm
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
Thomas Jansen, Ingo Wegener
98
Voted
JAIR
2012
205views Hardware» more  JAIR 2012»
13 years 3 months ago
COLIN: Planning with Continuous Linear Numeric Change
In this paper we describe COLIN, a forward-chaining heuristic search planner, capable of reasoning with COntinuous LINear numeric change, in addition to the full temporal semantic...
Amanda Jane Coles, Andrew Coles, Maria Fox, Derek ...