Sciweavers

511 search results - page 83 / 103
» TSP with bounded metrics
Sort
View
ADHOCNOW
2005
Springer
14 years 2 months ago
Reed-Solomon and Hermitian Code-Based Scheduling Protocols for Wireless Ad Hoc Networks
Abstract. In this work we investigate bounds on throughput and delay performance of a scheduling protocol that derives its decisions from codes traditionally used to correct or det...
Carlos H. Rentel, Thomas Kunz
ICNP
2003
IEEE
14 years 1 months ago
On the Cost-Quality Tradeoff in Topology-Aware Overlay Path Probing
Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as ¢¤£¦¥¨§© , which is prohibitive i...
Chiping Tang, Philip K. McKinley
HPDC
2002
IEEE
14 years 1 months ago
Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications
In high energy physics, bioinformatics, and other disciplines, we encounter applications involving numerous, loosely coupled jobs that both access and generate large data sets. So...
Kavitha Ranganathan, Ian T. Foster
ICC
2000
IEEE
14 years 27 days ago
Synchronizability of General Periodic Pattern Signals
— In this paper1 an optimum and sub-optimum maximum likelihood (ML) rule for joint frame and carrier frequency offset estimation are derived, which rely on the transmission of a...
Branimir Stantchev, Gerhard Fettweis
COMPGEOM
1994
ACM
14 years 17 days ago
Competitive Searching in a Generalized Street
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
Amitava Datta, Christian Icking