Sciweavers

4565 search results - page 798 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
INFOCOM
2002
IEEE
14 years 3 months ago
Efficient Dissemination of Personalized Information Using Content-Based Multicast
There has been a surge of interest in the delivery of personalized information to users (e.g. personalized stocks or travel information), particularly as mobile users with limited ...
Rahul Shah, Ravi Jain, Farooq Anjum
SIGCOMM
1998
ACM
14 years 2 months ago
Fast and Scalable Layer Four Switching
In Layer Four switching, the route and resources allocated to a packet are determined by the destination address as well as other header elds of the packet such as source address,...
Venkatachary Srinivasan, George Varghese, Subhash ...
ISPD
1997
ACM
68views Hardware» more  ISPD 1997»
14 years 2 months ago
Faster minimization of linear wirelength for global placement
A linear wirelength objective more e ectively captures timing, congestion, and other global placement considerations than a squared wirelength objective. The GORDIAN-L cell placem...
Charles J. Alpert, Tony F. Chan, Dennis J.-H. Huan...
AAAI
1997
13 years 11 months ago
Model Minimization in Markov Decision Processes
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
Thomas Dean, Robert Givan
TCAD
2008
128views more  TCAD 2008»
13 years 10 months ago
Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen C...