Sciweavers

570 search results - page 50 / 114
» Approximating Some Network Design Problems with Node Costs
Sort
View
252
Voted

Lecture Notes
443views
16 years 11 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
ICRA
2006
IEEE
106views Robotics» more  ICRA 2006»
15 years 7 months ago
Decentralized Optimization of Distributed Supply-chain
— In this paper, the problem of optimizing the performances of a distributed supply chain is faced by means of a decentralized architecture. In particular, a general scheme for a...
Marco Ghirardi, Giuseppe Menga, Nicola Sacco
JCO
2006
106views more  JCO 2006»
15 years 1 months ago
Reliable Ad Hoc Routing Based on Mobility Prediction
Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, bec...
Jian Tang, Guoliang Xue, Weiyi Zhang
OPODIS
2007
15 years 3 months ago
Peer to Peer Multidimensional Overlays: Approximating Complex Structures
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
Olivier Beaumont, Anne-Marie Kermarrec, Etienne Ri...
INFOCOM
2006
IEEE
15 years 7 months ago
Relay Placement for Higher Order Connectivity in Wireless Sensor Networks
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
Abhishek Kashyap, Samir Khuller, Mark A. Shayman