89 search results - page 14 / 18 » Admissibility in Infinite Games |
IANDC
2006
13 years 7 months ago
2006
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
CCGRID
2011
IEEE
12 years 11 months ago
2011
IEEE
Many large-scale distributed computing applications demand real-time responses by soft deadlines. To enable such real-time task distribution and execution on the volunteer resourc...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
We demonstrate two game theory-based programs for headsup limit and no-limit Texas Hold'em poker. The first player, GS3, is designed for playing limit Texas Hold'em, in ...
FOSSACS
2003
Springer
14 years 25 days ago
2003
Springer
Genericity is the idea that the same program can work at many different data types. Longo, Milstead and Soloviev proposed to capture the inability of generic programs to probe th...
FOIKS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. In this paper we recast the formalism of argumentation formalism known as DeLP (Defeasible Logic Programming) in game-theoretic terms. By considering a game between a Pro...