4007 search results - page 404 / 802 » Computation with imprecise probabilities |
184
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We present a method for topological SLAM that specifically targets loop closing for edge-ordered graphs. Instead of using a heuristic approach to accept or reject loop closing...
169
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
—We associate a statistical vector to a trace and a geometrical embedding to a Markov Decision Process, based on a distance on words, and study basic Membership and Equivalence p...
177
click to vote
CSL
2009
Springer
16 years 1 months ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
136
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Following a number of recent papers investigating the possibility of optimal comparison-based optimization algorithms for a given distribution of probability on fitness functions...
154
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...