3475 search results - page 340 / 695 » Backbones in Optimization and Approximation |
164
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
173
click to vote
DEDS
2010
15 years 6 months ago
2010
Abstract-- We address the problem of batching messages generated at nodes of a sensor network for the purpose of reducing communication energy at the expense of added latency. We f...
167
click to vote
DKE
2008
15 years 6 months ago
2008
Space constrained optimization problems arise in a variety of applications, ranging from databases to ubiquitous computing. Typically, these problems involve selecting a set of it...
173
click to vote
JCSS
2008
15 years 6 months ago
2008
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
224
click to vote
ML
1998
ACM
15 years 6 months ago
1998
ACM
To operate successfully in indoor environments, mobile robots must be able to localize themselves. Most current localization algorithms lack flexibility, autonomy, and often optim...