Sciweavers

7065 search results - page 984 / 1413
» Iterative Scheduling Algorithms
Sort
View
JCSS
2007
89views more  JCSS 2007»
15 years 6 months ago
The relative worst-order ratio applied to paging
The relative worst order ratio, a new measure for the quality of on-line algorithms, was recently defined and applied to two bin packing problems. Here, we extend the definition ...
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
IAT
2010
IEEE
15 years 4 months ago
Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
Melanie Smith, Roger Mailler
IJRR
2010
115views more  IJRR 2010»
15 years 4 months ago
Improving the Efficiency of Clearing with Multi-agent Teams
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
Geoffrey Hollinger, Sanjiv Singh, Athanasios Kehag...
CVPR
2009
IEEE
17 years 2 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...
CVPR
2003
IEEE
16 years 9 months ago
Nonparametric Belief Propagation
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...
Erik B. Sudderth, Alexander T. Ihler, William T. F...