Sciweavers

400 search results - page 68 / 80
» Backtracking
Sort
View
AAMAS
2000
Springer
13 years 8 months ago
Algorithms for Distributed Constraint Satisfaction: A Review
When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distrib...
Makoto Yokoo, Katsutoshi Hirayama
DCG
2002
66views more  DCG 2002»
13 years 8 months ago
Generation of Oriented Matroids - A Graph Theoretical Approach
We discuss methods for the generation of oriented matroids and of isomorphism classes of oriented matroids. Our methods are based on single element extensions and graph theoretica...
Lukas Finschi, Komei Fukuda
JAR
2000
90views more  JAR 2000»
13 years 8 months ago
Resolution versus Search: Two Strategies for SAT
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
Irina Rish, Rina Dechter
MST
2000
101views more  MST 2000»
13 years 8 months ago
Robust Parallel Computations through Randomization
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...
Spyros C. Kontogiannis, Grammati E. Pantziou, Paul...
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