Sciweavers

173 search results - page 30 / 35
» Asymptotic classes of finite structures
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 4 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
IGPL
2010
142views more  IGPL 2010»
13 years 4 months ago
Logics of Kripke meta-models
This paper introduces and studies a new type of logical construction, which allows to combine various non-classical propositional logics with the temporal or modal background. The...
Sergey Babenyshev, Vladimir V. Rybakov
JLP
2010
85views more  JLP 2010»
13 years 2 months ago
Synchronous Kleene algebra
The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner's SCCS calculus. The resulting algebraic structure ...
Cristian Prisacariu
ATAL
2007
Springer
14 years 1 months ago
Regret based dynamics: convergence in weakly acyclic games
Regret based algorithms have been proposed to control a wide variety of multi-agent systems. The appeal of regretbased algorithms is that (1) these algorithms are easily implement...
Jason R. Marden, Gürdal Arslan, Jeff S. Shamm...
ESORICS
2007
Springer
14 years 1 months ago
Incorporating Temporal Capabilities in Existing Key Management Schemes
The problem of key management in access hierarchies studies ways to assign keys to users and classes such that each user, after receiving her secret key(s), is able to independentl...
Mikhail J. Atallah, Marina Blanton, Keith B. Frikk...