4007 search results - page 358 / 802 » Computation with imprecise probabilities |
207
click to vote
TAMC
2009
Springer
16 years 2 months ago
2009
Springer
Priced Probabilistic Timed Automata (PPTA) extend timed automata with cost-rates in locations and discrete probabilistic branching. The model is a natural combination of Priced Tim...
189
click to vote
APSCC
2008
IEEE
16 years 2 months ago
2008
IEEE
—Vehicular ad hoc network protocol with hybrid relay architecture is proposed for improving the success ratio. Access gateway estimation and a probability table based on the rout...
172
click to vote
COLCOM
2008
IEEE
16 years 2 months ago
2008
IEEE
Abstract. We describe an approach for learning the model of the opponent in spatio-temporal negotiation. We use the Children in the Rectangular Forest canonical problem as an examp...
172
click to vote
FOCS
2008
IEEE
16 years 2 months ago
2008
IEEE
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. â€...
213
click to vote
ICDCS
2008
IEEE
16 years 2 months ago
2008
IEEE
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...