Sciweavers

17760 search results - page 170 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
137
Voted
PPSN
2010
Springer
15 years 2 months ago
General Lower Bounds for the Running Time of Evolutionary Algorithms
Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
Dirk Sudholt
TROB
2002
174views more  TROB 2002»
15 years 3 months ago
A general algorithm for robot formations using local sensing and minimal communication
Abstract-We study the problem of achieving global behavior in a group of distributed robots using only local sensing and minimal communication, in the context of formations. The go...
Jakob Fredslund, Maja J. Mataric
198
Voted
JUCS
2010
265views more  JUCS 2010»
15 years 2 months ago
A General Framework for Multi-Human Tracking using Kalman Filter and Fast Mean Shift Algorithms
: The task of reliable detection and tracking of multiple objects becomes highly complex for crowded scenarios. In this paper, a robust framework is presented for multi-Human track...
Ahmed Ali, Kenji Terada
156
Voted
IPPS
2010
IEEE
15 years 2 months ago
A general algorithm for detecting faults under the comparison diagnosis model
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
Iain A. Stewart
IPL
2000
92views more  IPL 2000»
15 years 3 months ago
A general method to speed up fixed-parameter-tractable algorithms
Rolf Niedermeier, Peter Rossmanith