3016 search results - page 204 / 604 » The Online Transportation Problem |
151
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—Motivated by streaming applications with stringent delay constraints, we consider the design of online network coding algorithms with timely delivery guarantees. Assuming that t...
132
click to vote
ISLPED
2009
ACM
15 years 11 months ago
2009
ACM
Increasing power densities and the high cost of low thermal resistance packages and cooling solutions make it impractical to design processors for worst-case temperature scenarios...
156
Voted
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
128
click to vote
ICRA
2007
IEEE
15 years 11 months ago
2007
IEEE
— The success of sampling-based motion planners has resulted in a plethora of methods for improving planning components, such as sampling and connection strategies, local planner...
138
click to vote
IROS
2007
IEEE
15 years 11 months ago
2007
IEEE
— This paper considers the problem of coordinating multiple vehicles with kinodynamic constraints that operate in the same partially-known environment. The vehicles are able to c...