282 search results - page 38 / 57 » Probabilistic Timed Behavior Trees |
SPAA
2000
ACM
13 years 12 months ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
We study information elicitation mechanisms in which a principal agent attempts to elicit the private information of other agents using a carefully selected payment scheme based o...
PPSN
2000
Springer
13 years 11 months ago
2000
Springer
This paper presents an adaptive tit-for-tat strategy and a study of its behavior in spatial IPD games. The adaptive tit-for-tat strategy is shown elsewhere to demonstrate high perf...
NIPS
2001
13 years 9 months ago
2001
This paper presents a novel approach to the unsupervised learning of syntactic analyses of natural language text. Most previous work has focused on maximizing likelihood according...
ISPDC
2008
IEEE
14 years 1 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...