Sciweavers

6976 search results - page 168 / 1396
» The Oil Searching Problem
Sort
View
AI
1999
Springer
15 years 6 months ago
Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
Holger H. Hoos, Thomas Stützle
MP
2008
60views more  MP 2008»
15 years 6 months ago
Extreme optics and the search for Earth-like planets
In this paper I describe a new and exciting application of optimization technology. The problem is to design a space telescope capable of imaging Earth-like planets around nearby s...
Robert J. Vanderbei
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
16 years 20 days ago
Genetic multi-step search in interpolation and extrapolation domain
The deterministic Multi-step Crossover Fusion (dMSXF) is an improved crossover method of MSXF which is a promising method of JSP, and it shows high availability in TSP. Both of th...
Yoshiko Hanada, Tomoyuki Hiroyasu, Mitsunori Miki
CP
2005
Springer
16 years 1 days ago
Multi-point Constructive Search
Abstract. Multi-Point Constructive Search maintains a small set of “elite solutions” that are used to heuristically guide constructive search through periodically restarting se...
J. Christopher Beck
PVM
2004
Springer
15 years 12 months ago
Neighborhood Composition: A Parallelization of Local Search Algorithms
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Mas...