Sciweavers

7006 search results - page 508 / 1402
» Approximation Algorithms
Sort
View
ATAL
2005
Springer
15 years 12 months ago
A polynomial algorithm for decentralized Markov decision processes with temporal constraints
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
Aurélie Beynier, Abdel-Illah Mouaddib
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
15 years 6 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri
164
Voted
EMMCVPR
2001
Springer
15 years 11 months ago
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
Yuri Boykov, Vladimir Kolmogorov
MEMICS
2010
15 years 1 months ago
A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
Ondrej Danek, Martin Maska
184
Voted
DEXAW
1999
IEEE
91views Database» more  DEXAW 1999»
15 years 10 months ago
Hierarchical Scheduling Algorithms for Near-Line Tape Libraries
Robotic tape libraries (RTLs) currently enjoy a prominent place in the storage market, with a reported average annual growth rate approaching 34%, primarily due to their low cost ...
Peter Triantafillou, Ioannis Georgiadis