Sciweavers

503 search results - page 89 / 101
» Two Algorithms for the Minimum Enclosing Ball Problem
Sort
View
76
Voted
CAAN
2006
Springer
15 years 1 months ago
Distributed Routing in Tree Networks with Few Landmarks
We consider the problem of finding a short path between any two nodes of a network when no global information is available, nor any oracle to help in routing. A mobile agent, situa...
Ioannis Z. Emiris, Euripides Markou, Aris Pagourtz...
SIGMETRICS
2002
ACM
103views Hardware» more  SIGMETRICS 2002»
14 years 9 months ago
Network tomography on general topologies
In this paper we consider the problem of inferring link-level loss rates from end-to-end multicast measurements taken from a collection of trees. We give conditions under which lo...
Tian Bu, Nick G. Duffield, Francesco Lo Presti, Do...
106
Voted
ICDCS
2010
IEEE
14 years 7 months ago
Safe and Stabilizing Distributed Cellular Flows
Advances in wireless vehicular networks present us with opportunities for developing new distributed traffic control algorithms that avoid phenomena such as abrupt phase-transition...
Taylor Johnson, Sayan Mitra, Karthik Manamcheri
TSP
2010
14 years 4 months ago
Beamforming and rate allocation in MISO cognitive radio networks
We consider decentralized multiantenna cognitive radio networks where the secondary (cognitive) users are granted simultaneous spectrum access along with the license-holding (prima...
Ali Tajer, Narayan Prasad, Xiaodong Wang
EOR
2007
198views more  EOR 2007»
14 years 9 months ago
Airline crew scheduling from planning to operations
Crew scheduling problems at the planning level are typically solved in two steps: first, creating working patterns, and then assigning these to individual crew. The first step is ...
Claude P. Medard, Nidhi Sawhney