Sciweavers

3808 search results - page 448 / 762
» Artificial Intelligence: A Modern Approach
Sort
View
ECAI
2008
Springer
15 years 8 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
AIPS
2004
15 years 8 months ago
Decision-Theoretic Military Operations Planning
Military operations planning involves concurrent actions, resource assignment, and conflicting costs. Individual tasks sometimes fail with a known probability, promoting a decisio...
Douglas Aberdeen, Sylvie Thiébaux, Lin Zhan...
FLAIRS
2004
15 years 8 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar
FLAIRS
2006
15 years 8 months ago
Adaptive, Confidence-Based Strategic Negotiations in Complex Multiagent Environments
We have designed and implemented an adaptive, confidence-based negotiation strategy for conducting multiple, concurrent negotiations among agents in dynamic, uncertain, and real-t...
Xin Li, Leen-Kiat Soh
FLAIRS
2006
15 years 8 months ago
Efficient Bids on Task Allocation for Multi-Robot Exploration
We propose a real time single item auction based task allocation method for the multi-robot exploration problem and investigate new bid evaluation strategies in this domain. In th...
Sanem Sariel, Tucker R. Balch