Sciweavers

1968 search results - page 172 / 394
» The Complexity of Valued Constraint Models
Sort
View
ATAL
2004
Springer
15 years 7 months ago
Decentralized Markov Decision Processes with Event-Driven Interactions
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
Raphen Becker, Shlomo Zilberstein, Victor R. Lesse...
CP
2007
Springer
15 years 8 months ago
Path Consistency by Dual Consistency
Dual Consistency (DC) is a property of Constraint Networks (CNs) which is equivalent, in its unrestricted form, to Path Consistency (PC). The principle is to perform successive sin...
Christophe Lecoutre, Stéphane Cardon, Julie...
EUROCRYPT
2004
Springer
15 years 7 months ago
Merkle Tree Traversal in Log Space and Time
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
Michael Szydlo
141
Voted
AB
2008
Springer
15 years 8 months ago
Local Structure and Behavior of Boolean Bioregulatory Networks
Abstract. A well-known discrete approach to modeling biological regulatory networks is the logical framework developed by R. Thomas. The network structure is captured in an interac...
Heike Siebert
108
Voted
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
15 years 5 months ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden