Sciweavers

1614 search results - page 105 / 323
» Breadth-First Heuristic Search
Sort
View
JMLR
2008
124views more  JMLR 2008»
15 years 6 months ago
Learning Control Knowledge for Forward Search Planning
A number of today's state-of-the-art planners are based on forward state-space search. The impressive performance can be attributed to progress in computing domain independen...
Sung Wook Yoon, Alan Fern, Robert Givan
ICDCS
1999
IEEE
15 years 10 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
CADE
2002
Springer
16 years 6 months ago
Reasoning by Symmetry and Function Ordering in Finite Model Generation
Abstract. Finite model search for first-order logic theories is complementary to theorem proving. Systems like Falcon, SEM and FMSET use the known LNH (Least Number Heuristic) heur...
Gilles Audemard, Belaid Benhamou
UAI
2003
15 years 7 months ago
Systematic vs. Non-systematic Algorithms for Solving the MPE Task
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
Radu Marinescu 0002, Kalev Kask, Rina Dechter
HEURISTICS
2008
124views more  HEURISTICS 2008»
15 years 6 months ago
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
Michael Polacek, Karl F. Doerner, Richard F. Hartl...