874 search results - page 2 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
KR
2004
Springer
14 years 10 days ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
AMET
1998
Springer
13 years 11 months ago
1998
Springer
We present an approach to the bid-evaluation problem in a system for multi-agent contract negotiation, called MAGNET. The MAGNET market infrastructure provides support for a variet...
IJRR
2010
13 years 4 months ago
2010
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
AIPS
2003
13 years 8 months ago
2003
Scheduling algorithms for real-time systems can be characterized in various ways, one of the most important ones of which is the underlying task model. Many concepts of real-time ...
AAAI
1996
13 years 8 months ago
1996
Anytime algorithms offer a tradeoff between solution quality and computation time that has proved useful in applying artificial intelligence techniques to time-critical problems. ...