540 search results - page 41 / 108 » Competitive Routing over Time |
ESA
2007
Springer
14 years 4 months ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
AAAI
2000
13 years 11 months ago
2000
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
GI
2009
Springer
13 years 8 months ago
2009
Springer
: Over time, large scale pickup and delivery providers acquire considerable amounts of data on customer orders, including order times, amount and configurations of freight, as well...
SIGMETRICS
1997
ACM
14 years 1 months ago
1997
ACM
One of the open questions in the design of multimedia storage servers is in what order to serve incoming requests. Given the capability provided by the disk layout and scheduling ...
FPGA
1999
ACM
14 years 2 months ago
1999
ACM
The demand for high-speed FPGA compilation tools has occurred for three reasons: first, as FPGA device capacity has grown, the computation time devoted to placement and routing h...