Sciweavers

1998 search results - page 252 / 400
» Complexity of the Cover Polynomial
Sort
View
91
Voted
IJCAI
2001
15 years 2 months ago
Market Clearability
Market mechanisms play a central role in AI as a coordination tool in multiagent systems and as an application area for algorithm design. Mechanisms where buyers are directly clea...
Tuomas Sandholm, Subhash Suri
NIPS
2004
15 years 2 months ago
Exploration-Exploitation Tradeoffs for Experts Algorithms in Reactive Environments
A reactive environment is one that responds to the actions of an agent rather than evolving obliviously. In reactive environments, experts algorithms must balance exploration and ...
Daniela Pucci de Farias, Nimrod Megiddo
103
Voted
IJCAI
2003
15 years 2 months ago
Incremental Utility Elicitation with the Minimax Regret Decision Criterion
Utility elicitation is a critical function of any automated decision aid, allowing decisions to be tailored to the preferences of a specific user. However, the size and complexit...
Tianhan Wang, Craig Boutilier
120
Voted
WSC
2004
15 years 2 months ago
Parallel Simulation of Group Behaviors
Group behaviors, e.g. birds flocking, are widely used in virtual reality, computer games, robotics and artificial life. While many methods to simulate group behaviors have been pr...
Bo Zhou, Suiping Zhou
95
Voted
AAAI
2000
15 years 2 months ago
Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
Richard E. Korf, Weixiong Zhang