Sciweavers

1465 search results - page 172 / 293
» Practically intelligent agents aiding human intelligence
Sort
View
AAAI
2004
15 years 5 months ago
Eliciting Bid Taker Non-price Preferences in (Combinatorial) Auctions
Recent algorithms provide powerful solutions to the problem of determining cost-minimizing (or revenue-maximizing) allocations of items in combinatorial auctions. However, in many...
Craig Boutilier, Tuomas Sandholm, Rob Shields
136
Voted
AAAI
2004
15 years 5 months ago
A General Solution to the Graph History Interaction Problem
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...
Akihiro Kishimoto, Martin Müller 0003
AAAI
2004
15 years 5 months ago
MAX-2-SAT: How Good Is Tabu Search in the Worst-Case?
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...
Monaldo Mastrolilli, Luca Maria Gambardella
AAAI
2006
15 years 5 months ago
Learning Partially Observable Action Models: Efficient Algorithms
We present tractable, exact algorithms for learning actions' effects and preconditions in partially observable domains. Our algorithms maintain a propositional logical repres...
Dafna Shahaf, Allen Chang, Eyal Amir
AAAI
2006
15 years 5 months ago
Prob-Maxn: Playing N-Player Games with Opponent Models
Much of the work on opponent modeling for game tree search has been unsuccessful. In two-player, zero-sum games, the gains from opponent modeling are often outweighed by the cost ...
Nathan R. Sturtevant, Martin Zinkevich, Michael H....