3946 search results - page 498 / 790 » The computational complexity of choice sets |
166
click to vote
UAI
2000
15 years 8 months ago
2000
Multi-agent games are becoming an increasingly prevalent formalism for the study of electronic commerceand auctions. The speed at which transactions can take place and the growing...
176
click to vote
AAAI
1994
15 years 8 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
191
click to vote
AIPS
2009
15 years 7 months ago
2009
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
171
click to vote
AAMAS
2007
Springer
15 years 6 months ago
2007
Springer
An original Reinforcement Learning (RL) methodology is proposed for the design of multi-agent systems. In the realistic setting of situated agents with local perception, the task o...
155
click to vote
ANOR
2010
15 years 6 months ago
2010
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...