Sciweavers

1615 search results - page 214 / 323
» Computer science and decision theory
Sort
View
LICS
2005
IEEE
16 years 13 days ago
Reactive Systems over Cospans
The theory of reactive systems, introduced by Leifer and Milner and previously extended by the authors, allows the derivation of well-behaved labelled transition systems (LTS) for...
Vladimiro Sassone, Pawel Sobocinski
SIGECOM
2005
ACM
153views ECommerce» more  SIGECOM 2005»
16 years 12 days ago
Marginal contribution nets: a compact representation scheme for coalitional games
We present a new approach to representing coalitional games based on rules that describe the marginal contributions of the agents. This representation scheme captures characterist...
Samuel Ieong, Yoav Shoham
MFCS
2005
Springer
16 years 10 days ago
Inverse Monoids: Decidability and Complexity of Algebraic Questions
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
Markus Lohrey, Nicole Ondrusch
ICALP
2004
Springer
16 years 7 days ago
Quantum Query Complexity of Some Graph Problems
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
Christoph Dürr, Mark Heiligman, Peter H&oslas...
RELMICS
2009
Springer
15 years 11 months ago
Foundations of Concurrent Kleene Algebra
Abstract. A Concurrent Kleene Algebra offers two composition operators, one that stands for sequential execution and the other for concurrent n [10]. In this paper we investigate ...
C. A. R. Hoare, Bernhard Möller, Georg Struth...