Sciweavers

854 search results - page 116 / 171
» Abstracting from Failure Probabilities
Sort
View
JUCS
2006
124views more  JUCS 2006»
15 years 4 months ago
Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM
Abstract: We present two probabilistic leader election algorithms for anonymous unidirectional rings with FIFO channels, based on an algorithm from Itai and Rodeh [Itai and Rodeh 1...
Wan Fokkink, Jun Pang
ANTSW
2010
Springer
14 years 11 months ago
A Deterministic Metaheuristic Approach Using "Logistic Ants" for Combinatorial Optimization
Abstract. Ant algorithms are usually derived from a stochastic modeling based on some specific probability laws. We consider in this paper a full deterministic model of "logis...
Rodolphe Charrier, Christine Bourjot, Franç...
183
Voted
IJRR
2011
226views more  IJRR 2011»
14 years 11 months ago
Place-dependent people tracking
Abstract People typically move and act under the constraints of an environment, making human behavior strongly place-dependent. Motion patterns, the places and the rates at which p...
Matthias Luber, Gian Diego Tipaldi, Kai Oliver Arr...
VMCAI
2012
Springer
14 years 7 days ago
A General Framework for Probabilistic Characterizing Formulae
Abstract. Recently, a general framework on characteristic formulae was proposed by Aceto et al. It offers a simple theory that allows one to easily obtain characteristic formulae o...
Joshua Sack, Lijun Zhang
COMBINATORICS
2000
96views more  COMBINATORICS 2000»
15 years 4 months ago
Automorphisms and Enumeration of Switching Classes of Tournaments
Two tournaments T1 and T2 on the same vertex set X are said to be switching equivalent if X has a subset Y such that T2 arises from T1 by switching all arcs between Y and its comp...
László Babai, Peter J. Cameron