Sciweavers

1599 search results - page 155 / 320
» Algorithms for Parity Games
Sort
View
TIT
2008
121views more  TIT 2008»
15 years 6 months ago
Asynchronous Iterative Water-Filling for Gaussian Frequency-Selective Interference Channels
This paper considers the maximization of information rates for the Gaussian frequency-selective interference channel, subject to power and spectral mask constraints on each link. T...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...
AAAI
2008
15 years 9 months ago
Using Reasoning Patterns to Simplify Games
In complex strategic situations decision-making agents interact with many other agents and have access to many pieces of information throughout their play. This usually leads to g...
Dimitrios Antos, Avi Pfeffer
AIIDE
2008
15 years 9 months ago
Agent Learning using Action-Dependent Learning Rates in Computer Role-Playing Games
We introduce the ALeRT (Action-dependent Learning Rates with Trends) algorithm that makes two modifications to the learning rate and one change to the exploration rate of traditio...
Maria Cutumisu, Duane Szafron, Michael H. Bowling,...
ATAL
2008
Springer
15 years 8 months ago
Searching for approximate equilibria in empirical games
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
Patrick R. Jordan, Yevgeniy Vorobeychik, Michael P...
COLT
2001
Springer
15 years 11 months ago
On Using Extended Statistical Queries to Avoid Membership Queries
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
Nader H. Bshouty, Vitaly Feldman