Sciweavers

4198 search results - page 340 / 840
» In search of lost time
Sort
View
CEC
2005
IEEE
16 years 14 days ago
A simple hybrid evolutionary algorithm for finding Golomb rulers
Abstract- Finding Golomb rulers is an extremely challenging optimization problem (with many practical applications) that has been approached by a variety of search methods in recen...
Iván Dotú, Pascal Van Hentenryck
CP
2005
Springer
16 years 12 days ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
IPPS
2000
IEEE
15 years 11 months ago
Information Exchange in Multi Colony Ant Algorithms
Multi colony ant algorithms are evolutionary optimization heuristics that are well suited for parallel execution. Information exchange between the colonies is an important topic th...
Martin Middendorf, Frank Reischle, Hartmut Schmeck
204
Voted
CIKM
2006
Springer
15 years 10 months ago
Approximate reverse k-nearest neighbor queries in general metric spaces
In this paper, we propose an approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our method uses an approx...
Elke Achtert, Christian Böhm, Peer Kröge...
190
Voted
FLAIRS
2007
15 years 9 months ago
Case-Based Recommendation of Node Ordering in Planning
Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...
Tomás de la Rosa, Angel García Olaya...