3110 search results - page 75 / 622 » On the initialization of the DNMF algorithm |
120
click to vote
SPIN
2000
Springer
15 years 8 months ago
2000
Springer
In this paper, we describe our application of SPIN 1 to model an algorithm used to synchronize the clocks of modules that provide periodic real-time communication over a network. W...
121
click to vote
AAAI
2004
15 years 5 months ago
2004
In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...
116
click to vote
AAAI
1994
15 years 5 months ago
1994
We de ne the probabilistic planning problem in terms of a probability distribution over initial world states, a boolean combination of goal propositions, a probability threshold, ...
149
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
133
click to vote
DC
2007
15 years 4 months ago
2007
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive a...