428 search results - page 56 / 86 » An asynchronous complete method for distributed constraint o... |
98
Voted
PG
2003
IEEE
15 years 8 months ago
2003
IEEE
Many popular motion editing methods do not take physical principles into account potentially producing implausible motions. This paper introduces an efficient method for touching...
110
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Imagine a group of cooperating agents attempting to allocate tasks amongst themselves without knowledge of their own capabilities. Over time, they develop a belief of their own sk...
141
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
122
click to vote
UAI
1998
15 years 4 months ago
1998
Recent research in decision theoretic planning has focussedon making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structur...
124
click to vote
CEC
2005
IEEE
15 years 5 months ago
2005
IEEE
Timetabling problems are constraint optimization problems proven to be NP complete. Furthermore, evaluation of violations is costly, and there is no common data format for represen...