569 search results - page 16 / 114 » An Efficient Algorithm for Solving Dynamic Complex DCOP Prob... |
141
click to vote
ATAL
2008
Springer
15 years 4 months ago
2008
Springer
In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versu...
138
click to vote
ICAI
2004
15 years 3 months ago
2004
In the age of electronic commerce, with low-cost information access, it has been recognized that a bundle search in a combinatorial trade is very valuable for buyers. Optimal trav...
246
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
122
click to vote
ATAL
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we produce complexity and impossibility results and develop algorithms for a task allocation problem that needs to be solved by a group of autonomous agents working ...
238
click to vote
ICC
2011
IEEE
14 years 1 months ago
2011
IEEE
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...