Sciweavers

57 search results - page 11 / 12
» The Nakamura numbers for computable simple games
Sort
View
DIGRA
2005
Springer
14 years 2 months ago
Framing Virtual Law
Building on the work of games theorists and virtual world designers, this paper proposes a framework for understanding the real-virtual dichotomy in terms of a series of five fram...
Peter Edelmann
CP
2000
Springer
14 years 5 days ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
CSL
2007
Springer
14 years 2 months ago
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
Dale Miller, Alexis Saurin
SIAMDM
2002
94views more  SIAMDM 2002»
13 years 8 months ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool
PODC
2005
ACM
14 years 2 months ago
Adaptive routing with stale information
We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this model, an infinite n...
Simon Fischer, Berthold Vöcking