4007 search results - page 420 / 802 » Computation with imprecise probabilities |
161
Voted
FOSSACS
2004
Springer
16 years 5 days ago
2004
Springer
Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present a ‘universal’ LMP as the spectrum of a commutat...
180
Voted
FSTTCS
2004
Springer
16 years 5 days ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
145
click to vote
GCC
2004
Springer
16 years 5 days ago
2004
Springer
In this paper, we propose a new structured overlay protocol, which is more efficient and scalable than previous ones. We call it Gemini, because its routing table consists of two p...
163
click to vote
GCC
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. In this paper, the resource availability issue has been addressed with respect to the intermittent connectivity and dynamic presence of peers in a P2P system. We aim to m...
173
click to vote
IBERAMIA
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...