4007 search results - page 321 / 802 » Computation with imprecise probabilities |
196
Voted
QEST
2008
IEEE
16 years 1 months 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...
224
Voted
CIBCB
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— This paper presents a parametric model to estimate the DNA-protein binding time using the DNA and protein structures and details of the binding site. To understand the ...
179
Voted
WAOA
2007
Springer
16 years 1 months ago
2007
Springer
We consider the following distributed optimization problem: three agents i = 1, 2, 3 are each presented with a load drawn independently from the same known prior distribution. Then...
205
click to vote
MOBICOM
2006
ACM
16 years 1 months ago
2006
ACM
The emergence of the 802.11a-based Dedicated Short Range Communications (DSRC) standard and advances in mobile ad hoc networking create ample opportunity for supporting delay-crit...
210
click to vote
PODC
2005
ACM
16 years 1 months ago
2005
ACM
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...