Sciweavers

3475 search results - page 53 / 695
» Backbones in Optimization and Approximation
Sort
View
ICNP
1998
IEEE
14 years 2 months ago
Evaluating the Overheads of Source-Directed Quality-of-Service Routing
Quality-of-service (QoS) routing satisfiesapplication performance requirements and optimizes network resource usage but effective path-selection schemes require the distribution o...
Anees Shaikh, Jennifer Rexford, Kang G. Shin
IJCAI
2003
13 years 11 months ago
Phase Transitions of the Asymmetric Traveling Salesman
We empirically study phase transitions of the asymmetric Traveling Salesman. Using random instances of up to 1,500 cities, we show that many properties of the problem, including t...
Weixiong Zhang
CCR
1999
93views more  CCR 1999»
13 years 9 months ago
A RED discard strategy for ATM networks and its performance evaluation with TCP/IP traffic
In ATM UBR networks supporting TCP traffic, optimal efficiency can only be envisaged if switches adopt a discard mechanism that operates at the packet level rather than the cell l...
Vincent Rosolen, Olivier Bonaventure, Guy Leduc
DCOSS
2006
Springer
14 years 1 months ago
Approximation Algorithms for Power-Aware Scheduling of Wireless Sensor Networks with Rate and Duty-Cycle Constraints
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
Rajgopal Kannan, Shuangqing Wei
SIAMJO
2008
57views more  SIAMJO 2008»
13 years 10 months ago
Universal Confidence Sets for Solutions of Optimization Problems
We consider random approximations to deterministic optimization problems. The objective function and the constraint set can be approximated simultaneously. Relying on concentratio...
Silvia Vogel