Sciweavers

575 search results - page 97 / 115
» A Spectral Approach to Lower Bounds
Sort
View
IPL
2008
114views more  IPL 2008»
13 years 7 months ago
The online Prize-Collecting Traveling Salesman Problem
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
GLOBECOM
2010
IEEE
13 years 5 months ago
An Exit-Chart Aided Design Procedure for Near-Capacity N-Component Parallel Concatenated Codes
1 Shannon's channel capacity specifies the upper bound on the amount of bits per channel use. In this paper, we explicitly demonstrate that twin-component turbo codes suffer f...
Hong Chen, Robert G. Maunder, Lajos Hanzo
INFOCOM
2010
IEEE
13 years 5 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
CP
2001
Springer
13 years 12 months ago
Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. The local instruction scheduling problem is to nd a m...
Peter van Beek, Kent D. Wilken
RTAS
2007
IEEE
14 years 1 months ago
Hijack: Taking Control of COTS Systems for Real-Time User-Level Services
This paper focuses on a technique to empower commercial-off-the-shelf (COTS) systems with an execution environment, and corresponding services, to support realtime and embedded ap...
Gabriel Parmer, Richard West