Sciweavers

376 search results - page 38 / 76
» Solution Counting Algorithms for Constraint-Centered Search ...
Sort
View
77
Voted
AAAI
2007
15 years 4 hour ago
Best-First Search for Treewidth
Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found b...
P. Alex Dow, Richard E. Korf
153
Voted
CP
2009
Springer
15 years 10 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey
AIPS
2003
14 years 11 months ago
Reasoning about Autonomous Processes in an Estimated-Regression Planner
We examine the issues that arise in extending an estimatedregression (ER) planner to reason about autonomous processes that run and have continuous and discrete effects without th...
Drew V. McDermott
IPPS
2000
IEEE
15 years 2 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
TEC
2002
152views more  TEC 2002»
14 years 9 months ago
Ant colony optimization for resource-constrained project scheduling
An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general...
Daniel Merkle, Martin Middendorf, Hartmut Schmeck