2796 search results - page 111 / 560 » The coolest path problem |
186
click to vote
IPCCC
2006
IEEE
15 years 11 months ago
2006
IEEE
We study the routing problem for multi-hop wireless ad hoc networks based on cooperative transmission. We prove that the Minimum Energy Cooperative Path (MECP) routing problem, i....
125
click to vote
PAM
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. IPv6 provides an expanded address space to satisfy the future Internet requirements. In this paper we compare and analyze onemonth measurements of the end-to-end IPv6 del...
138
click to vote
ICCAD
2000
IEEE
15 years 9 months ago
2000
IEEE
This paper describes an algorithm for simultaneous gate sizing and fanout optimization along the timing-critical paths in a circuit. First, a continuous-variable delay model that ...
162
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
249
click to vote
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract-- We consider a wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm th...