Sciweavers

1599 search results - page 261 / 320
» Algorithms for Parity Games
Sort
View
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 1 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
ATAL
2008
Springer
14 years 11 months ago
No-regret learning and a mechanism for distributed multiagent planning
We develop a novel mechanism for coordinated, distributed multiagent planning. We consider problems stated as a collection of single-agent planning problems coupled by common soft...
Jan-P. Calliess, Geoffrey J. Gordon
ICML
2001
IEEE
15 years 10 months ago
Convergence of Gradient Dynamics with a Variable Learning Rate
As multiagent environments become more prevalent we need to understand how this changes the agent-based paradigm. One aspect that is heavily affected by the presence of multiple a...
Michael H. Bowling, Manuela M. Veloso
SIGSOFT
2005
ACM
15 years 10 months ago
Online testing with model programs
Online testing is a technique in which test derivation from a model program and test execution are combined into a single algorithm. We describe a practical online testing algorit...
Margus Veanes, Colin Campbell, Wolfram Schulte, Ni...
EUROGRAPHICS
2010
Eurographics
15 years 6 months ago
Real-time Realistic Ocean Lighting using Seamless Transitions from Geometry to BRDF
Realistic animation and rendering of the ocean is an important aspect for simulators, movies and video games. By nature, the ocean is a difficult problem for Computer Graphics: i...
Eric Bruneton, Fabrice Neyret, Nicolas Holzschuch