Sciweavers

1026 search results - page 39 / 206
» An Optimal Solution to Room Search Problem
Sort
View
ATAL
2010
Springer
15 years 11 hour ago
Local search for distributed asymmetric optimization
Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned b...
Alon Grubshtein, Roie Zivan, Tal Grinshpoun, Amnon...
EMO
2001
Springer
107views Optimization» more  EMO 2001»
15 years 4 months ago
Reducing Local Optima in Single-Objective Problems by Multi-objectivization
One common characterization of how simple hill-climbing optimization methods can fail is that they become trapped in local optima - a state where no small modi cation of the curren...
Joshua D. Knowles, Richard A. Watson, David Corne
IJAIT
2002
81views more  IJAIT 2002»
14 years 11 months ago
Guiding Constructive Search with Statistical Instance-Based Learning
Several real world applications involve solving combinatorial optimization problems. Commonly, existing heuristic approaches are designed to address specific difficulties of the u...
Orestis Telelis, Panagiotis Stamatopoulos
GECCO
2000
Springer
131views Optimization» more  GECCO 2000»
15 years 3 months ago
A Genetic Algorithm with Tabu Search for Multimodal and Multiobjective Function Optimization
The integration of genetic algorithms (GAs) and tabu search is one of traditional problems in function optimization in the GA literature. However, most proposed methods have utili...
Setsuya Kurahashi, Takao Terano
IJCAI
2003
15 years 1 months ago
Contract Algorithms and Robots on Rays: Unifying Two Scheduling Problems
We study two apparently different, but formally similar, scheduling problems. The first problem involves contract algorithms, which can trade off run time for solution quality, a...
Daniel S. Bernstein, Lev Finkelstein, Shlomo Zilbe...