Sciweavers

1616 search results - page 111 / 324
» Robust game theory
Sort
View
LATIN
2010
Springer
14 years 3 months ago
The Language Theory of Bounded Context-Switching
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
ICCAD
1997
IEEE
117views Hardware» more  ICCAD 1997»
14 years 1 months ago
Generalized matching from theory to application
This paper presents a novel approach for post-mapping optimization. We exploit the concept of generalized matching, a technique that nds symbolically all possible matching assignm...
Patrick Vuillod, Luca Benini, Giovanni De Micheli
CORR
2000
Springer
96views Education» more  CORR 2000»
13 years 9 months ago
Robustness of Regional Matching Scheme over Global Matching Scheme
Analyzing the effect of concentrated noise on a typical decision-making process of a simplified two-candidate voting model, we have demonstrated that a local approach using a regi...
Liang Chen, Naoyuki Tokuda
CHI
2004
ACM
14 years 2 months ago
The untapped world of video games
Due to fierce industry competition and demand for novelty, games are a fertile research setting for studying interface design, input devices, graphics, social communication and de...
Kevin Keeker, Randy J. Pagulayan, Jonathan Sykes, ...
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
14 years 1 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...