455 search results - page 81 / 91 » Approximation Algorithms for Partial Covering Problems |
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper we study the problem of dynamic optimization of ping schedule in an active sonar buoy network deployed to provide persistent surveillance of a littoral area throu...
PADS
1999
ACM
15 years 2 months ago
1999
ACM
Most work to date in parallel and distributed discrete event simulation is based on assigning precise time stamps to events, and time stamp order event processing. An alternative ...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Consider the problem of joint parameter estimation and prediction in a Markov random field: i.e., the model parameters are estimated on the basis of an initial set of data, and th...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
ICRA
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract— We propose a planning algorithm that allows usersupplied domain knowledge to be exploited in the synthesis of information feedback policies for systems modeled as parti...