1120 search results - page 52 / 224 » Eager Markov Chains |
COMBINATORICS
2000
14 years 11 months ago
2000
This note extends a recent result of Kannan, Tetali and Vempala to completely solve, via a simple proof, the problem of random generation of a labeled tournament with a given scor...
211
click to vote
AAECC
2011
Springer
14 years 6 months ago
2011
Springer
A proof of the Generalized Road Coloring Problem, independent of the recent work by Beal and Perrin, is presented, using both semigroup methods and Trakhtman’s algorithm. Algebra...
AIPS
1996
15 years 1 months ago
1996
An increasing number of planners can handle uncertainty in the domain or in action outcomes. However, less work has addressed building plans when the planner's world can chan...
105
click to vote
PE
2002
Springer
14 years 11 months ago
2002
Springer
This paper evaluates and compares the performance of two approaches for locating an agent in a mobile agent environment. The first approach dynamically creates a chain of forwarde...
SIGSOFT
2009
ACM
16 years 17 days ago
2009
ACM
In this paper, we present Reo2MC, a tool chain for the performance evaluation of coordination models. Given a coordination model represented by a stochastic Reo connector, Reo2MC ...