4894 search results - page 747 / 979 » The Guarding Problem - Complexity and Approximation |
EMMCVPR
2001
Springer
14 years 21 days ago
2001
Springer
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...
FOCS
2000
IEEE
14 years 19 days ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
ICRA
1999
IEEE
14 years 15 days ago
1999
IEEE
Mobile robot localization is the problem of determining a robot's pose from sensor data. This article presents a family of probabilisticlocalization algorithms known as Monte...
PPSN
1998
Springer
14 years 13 days ago
1998
Springer
This paper presents a novel evolutionary approach of approximating the shape of the Pareto-optimal set of multi-objective optimization problems. The evolutionary algorithm (EA) use...
STOC
1997
ACM
14 years 12 days ago
1997
ACM
We consider the paging problem where the pages have varying size. This problem has applications to page replacement policies for caches containing World Wide Web documents. We con...