Sciweavers

94 search results - page 9 / 19
» aaai 1997
Sort
View
AAAI
1997
14 years 11 months ago
Dynamic Prioritization of Complex Agents in Distributed Constraint Satisfaction Problems
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
Aaron A. Armstrong, Edmund H. Durfee
AAAI
1997
14 years 11 months ago
Worst-Case Absolute Loss Bounds for Linear Learning Algorithms
The absolute loss is the absolute difference between the desired and predicted outcome. I demonstrateworst-case upper bounds on the absolute loss for the perceptron algorithm and ...
Tom Bylander
AAAI
1997
14 years 11 months ago
Tabu Search for SAT
In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Se...
Bertrand Mazure, Lakhdar Sais, Éric Gr&eacu...
AAAI
1997
14 years 11 months ago
Bayes Networks for Estimating the Number of Solutions to a CSP
The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the proba...
Amnon Meisels, Solomon Eyal Shimony, Gadi Solotore...
AAAI
1997
14 years 11 months ago
Agent Architectures for Flexible, Practical Teamwork
Teamwork in complex, dynamic, multi-agent domains mandates highly flexible coordination and communication. Simply fitting individual agents with precomputed coordination plans w...
Milind Tambe