Sciweavers

5580 search results - page 9 / 1116
» Randomized priority algorithms
Sort
View
WADS
1995
Springer
138views Algorithms» more  WADS 1995»
13 years 11 months ago
Fast Meldable Priority Queues
Gerth Stølting Brodal
IEAAIE
2009
Springer
13 years 5 months ago
Plan Repair in Conflict-Free Routing
In conflict-free routing a set of agents have to traverse a common infrastructure without interfering with each other. Maza and Castagna [1] showed how route plans can be repaired ...
Adriaan ter Mors, Cees Witteveen
ICCV
2007
IEEE
14 years 9 months ago
Probabilistic Color and Adaptive Multi-Feature Tracking with Dynamically Switched Priority Between Cues
We present a probabilistic multi-cue tracking approach constructed by employing a novel randomized template tracker and a constant color model based particle filter. Our approach ...
François Le Clerc, Lionel Oisel, Patrick P&...
CP
2005
Springer
14 years 1 months ago
Dynamic Ordering for Asynchronous Backtracking on DisCSPs
An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT DO. Agents propose reorderings of lower priority agents a...
Roie Zivan, Amnon Meisels