Sciweavers

4894 search results - page 654 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
COR
2004
111views more  COR 2004»
15 years 3 months ago
Multiple multicast tree allocation in IP network
The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols...
Chae Y. Lee, Hee K. Cho
136
Voted
JCO
2000
116views more  JCO 2000»
15 years 3 months ago
Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
Piotr Berman, Bhaskar DasGupta
ICRA
2010
IEEE
135views Robotics» more  ICRA 2010»
15 years 2 months ago
Implicit nonlinear complementarity: A new approach to contact dynamics
— Contact dynamics are commonly formulated as a linear complementarity problem. While this approach is superior to earlier spring-damper models, it can be inaccurate due to pyram...
Emanuel Todorov
INFOCOM
2010
IEEE
15 years 2 months ago
Two Samples are Enough: Opportunistic Flow-level Latency Estimation using NetFlow
—The inherent support in routers (SNMP counters or NetFlow) is not sufficient to diagnose performance problems in IP networks, especially for flow-specific problems where the ...
Myungjin Lee, Nick G. Duffield, Ramana Rao Kompell...
INFOCOM
2010
IEEE
15 years 2 months ago
VBS: Maximum Lifetime Sleep Scheduling for Wireless Sensor Networks Using Virtual Backbones
—Wireless sensor network (WSN) applications require redundant sensors to guarantee fault tolerance. However, the same degree of redundancy is not necessary for multi-hop communic...
Yaxiong Zhao, Jie Wu, Feng Li, Sanglu Lu