Sciweavers

1639 search results - page 200 / 328
» Anytime Heuristic Search
Sort
View
ICRA
2008
IEEE
135views Robotics» more  ICRA 2008»
14 years 3 months ago
Path and trajectory diversity: Theory and algorithms
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
Michael S. Branicky, Ross A. Knepper, James J. Kuf...
ETS
2007
IEEE
94views Hardware» more  ETS 2007»
14 years 3 months ago
An Integrated Built-In Test and Repair Approach for Memories with 2D Redundancy
An efficient on-chip infrastructure for memory test and repair is crucial to enhance yield and availability of SoCs. Therefore embedded memories are commonly equipped with spare r...
Philipp Öhler, Sybille Hellebrand, Hans-Joach...
ADBIS
2007
Springer
117views Database» more  ADBIS 2007»
14 years 3 months ago
Improving the Performance of M-Tree Family by Nearest-Neighbor Graphs
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
Tomás Skopal, David Hoksza
CP
2007
Springer
14 years 3 months ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
GECCO
2007
Springer
236views Optimization» more  GECCO 2007»
14 years 3 months ago
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
Quan-Qe Pan, Mehmet Fatih Tasgetiren, Yun-Chia Lia...