Sciweavers

5831 search results - page 19 / 1167
» Distributed Dynamic Backtracking
Sort
View
PROCEDIA
2011
12 years 11 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
AAAI
1994
13 years 10 months ago
Exploiting Meta-Level information in a Distributed Scheduling System
In this paper, we study the problem of achieving efficient interaction in a distributed scheduling system whose scheduling agents may borrow resources from one another. Specifical...
Daniel E. Neiman, David W. Hildum, Victor R. Lesse...
IJCAI
1989
13 years 9 months ago
A Planning/Scheduling Methodology for the Constrained Resource Problem
This paper presents a new planning/scheduling methodology for the constrained resource problem (CRP), in which the amount of available resources is limited and usually monotonical...
Naiping Keng, David Y. Y. Yun
AI
1999
Springer
13 years 8 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter