4894 search results - page 480 / 979 » The Guarding Problem - Complexity and Approximation |
131
click to vote
COMPGEOM
2005
ACM
15 years 7 months ago
2005
ACM
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
192
click to vote
DCOSS
2008
Springer
15 years 6 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
164
click to vote
ESA
2008
Springer
15 years 6 months ago
2008
Springer
We study the mechanism design problem of scheduling unrelated machines and we completely characterize the decisive truthful mechanisms for two players when the domain contains bot...
154
click to vote
NIPS
2007
15 years 6 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
157
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...