Sciweavers

2796 search results - page 432 / 560
» The coolest path problem
Sort
View
155
Voted
TCOM
2008
81views more  TCOM 2008»
15 years 6 months ago
On optimal computation of MPLS label binding for multipoint-to-point connections
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of under...
Fernando Solano, Ramón Fabregat, José...
JNCA
2008
103views more  JNCA 2008»
15 years 6 months ago
Congestion control of bluetooth radio system by piconet restructuring
Bluetooth is a low-cost and short-range wireless communication technology. Two or more bluetooth devices connected form a piconet and two or more piconets connected form a scatter...
Gwo-Jong Yu, Chih-Yung Chang
MP
2011
15 years 1 months ago
An FPTAS for minimizing the product of two non-negative linear cost functions
We consider a quadratic programming (QP) problem (Π) of the form min xT Cx subject to Ax ≥ b where C ∈ Rn×n + , rank(C) = 1 and A ∈ Rm×n , b ∈ Rm . We present an FPTAS ...
Vineet Goyal, Latife Genç Kaya, R. Ravi
FOCS
1997
IEEE
15 years 10 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...
FOCS
1993
IEEE
15 years 10 months ago
An On-Line Algorithm for Improving Performance in Navigation
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
Avrim Blum, Prasad Chalasani