4894 search results - page 152 / 979 » The Guarding Problem - Complexity and Approximation |
173
click to vote
COCOON
2001
Springer
15 years 11 months ago
2001
Springer
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look...
204
click to vote
UAI
2000
15 years 7 months ago
2000
We consider the problem belief-state monitoring for the purposes of implementing a policy for a partially-observable Markov decision process (POMDP), specifically how one might ap...
203
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
We introduce a new probing problem: what is the minimum number of cameras at fixed positions necessary and sufficient to reconstruct any strictly convex polygon contained in a dis...
144
click to vote
AMC
2005
15 years 6 months ago
2005
We solve a Laplacian problem over an L-shaped domain using a singular function boundary integral method as well as the p/hp finite element method. In the former method, the soluti...
218
click to vote
OL
2011
15 years 1 months ago
2011
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...