Sciweavers

459 search results - page 22 / 92
» Approximation Algorithms for Buy-at-Bulk Geometric Network D...
Sort
View
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
13 years 10 months ago
Improved algorithms for orienteering and related problems
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
Chandra Chekuri, Nitish Korula, Martin Pál
RTCSA
2003
IEEE
14 years 1 months ago
An Approximation Algorithm for Broadcast Scheduling in Heterogeneous Clusters
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-theshelf processors become cheaper and faster, it...
Pangfeng Liu, Da-Wei Wang, Yi-Heng Guo
TON
2008
136views more  TON 2008»
13 years 8 months ago
A geometric approach to improving active packet loss measurement
Abstract-- Measurement and estimation of packet loss characteristics are challenging due to the relatively rare occurrence and typically short duration of packet loss episodes. Whi...
Joel Sommers, Paul Barford, Nick G. Duffield, Amos...
INFOCOM
2007
IEEE
14 years 2 months ago
Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks
Abstract— Data aggregation is a fundamental yet timeconsuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation...
Scott C.-H. Huang, Peng-Jun Wan, Chinh T. Vu, Ying...
IJON
2007
98views more  IJON 2007»
13 years 8 months ago
Convergent design of piecewise linear neural networks
Piecewise linear networks (PLNs) are attractive because they can be trained quickly and provide good performance in many nonlinear approximation problems. Most existing design alg...
Hema Chandrasekaran, Jiang Li, W. H. Delashmit, Pr...