Sciweavers

367 search results - page 47 / 74
» Truncated incremental search
Sort
View
CP
2008
Springer
14 years 11 months ago
Exploiting Decomposition in Constraint Optimization Problems
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
Matthew Kitching, Fahiem Bacchus
GECCO
2009
Springer
113views Optimization» more  GECCO 2009»
14 years 7 months ago
Single step evolution of robot controllers for sequential tasks
The generation of robot controllers for a task requiring a sequence of elementary behaviors is still a challenge. If these behaviors are known, intermediate steps can be given to ...
Stéphane Doncieux, Jean-Baptiste Mouret
ICDE
2009
IEEE
198views Database» more  ICDE 2009»
15 years 11 months ago
V*-kNN: An Efficient Algorithm for Moving k Nearest Neighbor Queries
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kul...
WWW
2007
ACM
15 years 10 months ago
On building graphs of documents with artificial ants
We present an incremental algorithm for building a neighborhood graph from a set of documents. This algorithm is based on a population of artificial agents that imitate the way re...
Hanane Azzag, Julien Lavergne, Christiane Guinot, ...
ICCAD
2001
IEEE
108views Hardware» more  ICCAD 2001»
15 years 6 months ago
Single-Pass Redundancy Addition and Removal
Redundancy-addition-and-removal is a rewiring technique which for a given target wire wt finds a redundant alternative wire wa. Addition of wa makes wt redundant and hence removab...
Chih-Wei Jim Chang, Malgorzata Marek-Sadowska