350 search results - page 60 / 70 » Lower and upper bounds on obtaining history independence |
156
click to vote
QEST
2008
IEEE
16 years 14 days ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
188
click to vote
JMLR
2012
13 years 8 months ago
2012
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
171
click to vote
IPPS
2007
IEEE
16 years 11 days ago
2007
IEEE
A Reconfigurable Consistency Algorithm (RCA) is an algorithm that guarantees the consistency in Distributed Shared Memory (DSM) Systems. In a RCA, there is a Configuration Control...
133
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
155
click to vote
APPROX
2006
Springer
15 years 9 months ago
2006
Springer
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...