4894 search results - page 747 / 979 » The Guarding Problem - Complexity and Approximation |
133
Voted
EMMCVPR
2001
Springer
15 years 7 months 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...
131
Voted
FOCS
2000
IEEE
15 years 7 months 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...
117
Voted
ICRA
1999
IEEE
15 years 7 months 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...
119
click to vote
PPSN
1998
Springer
15 years 6 months 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...
132
Voted
STOC
1997
ACM
15 years 6 months 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...