Sciweavers

603 search results - page 10 / 121
» DFS-Tree Based Heuristic Search
Sort
View
IJCAI
2001
13 years 9 months ago
Local Search Topology in Planning Benchmarks: An Empirical Analysis
Many state-of-the-art heuristic planners derive their heuristic function by relaxing the planning task at hand, where the relaxation is to assume that all delete lists are empty. ...
Jörg Hoffmann
CP
2004
Springer
14 years 1 months ago
Counting-Based Look-Ahead Schemes for Constraint Satisfaction
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
Kalev Kask, Rina Dechter, Vibhav Gogate
CSB
2005
IEEE
125views Bioinformatics» more  CSB 2005»
14 years 1 months ago
On Optimizing Distance-Based Similarity Search for Biological Databases
Similarity search leveraging distance-based index structures is increasingly being used for both multimedia and biological database applications. We consider distance-based indexi...
Rui Mao, Weijia Xu, Smriti R. Ramakrishnan, Glen N...
TIT
1998
79views more  TIT 1998»
13 years 7 months ago
Greedy and Heuristic Algorithms for Codes and Colorings
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
Tuvi Etzion, Patric R. J. Östergård
EOR
2010
104views more  EOR 2010»
13 years 5 months ago
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
Fatih Safa Erenay, Ihsan Sabuncuoglu, Aysegül...