Sciweavers

89 search results - page 9 / 18
» Admissibility in Infinite Games
Sort
View
APAL
2006
107views more  APAL 2006»
13 years 7 months ago
Frege systems for extensible modal logics
By a well-known result of Cook and Reckhow [4, 12], all Frege systems for the Classical Propositional Calculus (CPC) are polynomially equivalent. Mints and Kojevnikov [11] have re...
Emil Jerábek
CONCUR
2010
Springer
13 years 8 months ago
Obliging Games
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...
Krishnendu Chatterjee, Florian Horn, Christof L&ou...
ICDE
2010
IEEE
246views Database» more  ICDE 2010»
14 years 7 months ago
Admission Control Mechanisms for Continuous Queries in the Cloud
Abstract--Amazon, Google, and IBM now sell cloud computing services. We consider the setting of a for-profit business selling data stream monitoring/management services and we inve...
Alexandros Labrinidis, Christine Chung, Kirk Pruhs...
PDPTA
2004
13 years 9 months ago
Achieving Flow Level QoS in Cut-Through Networks Through Admission Control and DiffServ
Cluster networks will serve as the future access networks for multimedia streaming, massive multiplayer online gaming, e-commerce, network storage etc. And for those application ar...
Frank Olaf Sem-Jacobsen, Sven-Arne Reinemo, Tor Sk...
IFIPTCS
2010
13 years 5 months ago
A Game-Theoretic Approach to Routing under Adversarial Conditions
Abstract. We present a game-theoretic framework for modeling and solving routing problems in dynamically changing networks. The model covers the aspects of reactivity and non-termi...
James Gross, Frank G. Radmacher, Wolfgang Thomas