Sciweavers

473 search results - page 95 / 95
» Computing shortest paths with uncertainty
Sort
View
SIGCOMM
2012
ACM
13 years 23 hour ago
Finishing flows quickly with preemptive scheduling
Today’s data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from o...
Chi-Yao Hong, Matthew Caesar, Brighten Godfrey
MOR
2008
169views more  MOR 2008»
14 years 9 months ago
The Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
Alper Atamtürk, Muhong Zhang
90
Voted
ISRR
2005
Springer
154views Robotics» more  ISRR 2005»
15 years 3 months ago
Session Overview Planning
ys when planning meant searching for a sequence of abstract actions that satisfied some symbolic predicate. Robots can now learn their own representations through statistical infe...
Nicholas Roy, Roland Siegwart