Sciweavers

511 search results - page 38 / 103
» TSP with bounded metrics
Sort
View
111
Voted
JPDC
2007
184views more  JPDC 2007»
14 years 9 months ago
Modeling of concurrent web sessions with bounded inconsistency in shared data
Client interactions with modern web-accessible network services are typically organized into sessions involving multiple requests that read and write shared application data. Ther...
Alexander Totok, Vijay Karamcheti
DAM
1998
67views more  DAM 1998»
14 years 9 months ago
A Graph-theoretic Generalization of the Sauer-Shelah Lemma
We show a natural graph-theoretic generalization of the Sauer–Shelah lemma. This result is applied to bound the ‘∞ and L1 packing numbers of classes of functions whose range...
Nicolò Cesa-Bianchi, David Haussler
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
15 years 7 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
TASE
2010
IEEE
14 years 4 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
TSP
2010
14 years 4 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