Sciweavers

914 search results - page 163 / 183
» Branch and Bound on the Network Model
Sort
View
ICRA
2006
IEEE
111views Robotics» more  ICRA 2006»
14 years 1 months ago
Placement and Distributed Deployment of Sensor Teams for Triangulation based Localization
— We address the problem of placing a sensor network so as to minimize the uncertainty in estimating the position of targets. The novelty of our formulation is in the sensing mod...
Volkan Isler
ICNP
2005
IEEE
14 years 1 months ago
On Understanding of Transient Interdomain Routing Failures
The convergence time of the interdomain routing protocol, BGP, can last as long as 30 minutes [14,15]. Yet, routing behavior during BGP route convergence is poorly understood. BGP...
Feng Wang, Lixin Gao, Jia Wang, Jian Qiu
ESA
2004
Springer
91views Algorithms» more  ESA 2004»
14 years 24 days ago
Maximizing Throughput in Multi-queue Switches
We study a basic problem in Multi-Queue switches. A switch connects m input ports to a single output port. Each input port is equipped with an incoming FIFO queue with bounded cap...
Yossi Azar, Arik Litichevskey
INFOCOM
1996
IEEE
13 years 11 months ago
Congestion-Oriented Shortest Multipath Routing
We present a framework for the modeling of multipath routing in connectionless networks that dynamically adapt to network congestion. The basic routing protocol uses a short-term ...
Shree Murthy, J. J. Garcia-Luna-Aceves
PODC
2010
ACM
13 years 11 months ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela