Sciweavers

185 search results - page 19 / 37
» Discrete online TSP
Sort
View
SODA
2001
ACM
166views Algorithms» more  SODA 2001»
13 years 9 months ago
Better approximation algorithms for bin covering
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
János Csirik, David S. Johnson, Claire Keny...
TSP
2010
13 years 2 months ago
Sequential and cooperative sensing for multi-channel cognitive radios
Effective spectrum sensing is a critical prerequisite for multi-channel cognitive radio (CR) networks, where multiple spectrum bands are sensed to identify transmission opportuniti...
Seung-Jun Kim, Georgios B. Giannakis
CDC
2010
IEEE
125views Control Systems» more  CDC 2010»
12 years 11 months ago
Persistent patrol with limited-range on-board sensors
— We propose and analyze the Persistent Patrol Problem (PPP). An unmanned aerial vehicle (UAV) moving with constant speed and unbounded acceleration patrols a bounded region of t...
Vu Anh Huynh, John Enright, Emilio Frazzoli
CPM
2009
Springer
94views Combinatorics» more  CPM 2009»
14 years 2 months ago
Online Approximate Matching with Non-local Distances
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
Raphaël Clifford, Benjamin Sach
CPAIOR
2008
Springer
13 years 9 months ago
Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
Luc Mercier, Pascal Van Hentenryck