1405 search results - page 93 / 281 » Popularity at Minimum Cost |
133
click to vote
SODA
1998
ACM
15 years 5 months ago
1998
ACM
Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost, maintain a cache of files of ...
118
click to vote
FOCS
1994
IEEE
15 years 8 months ago
1994
IEEE
This paper studies the problem of e ciently scheduling fully strict (i.e., wellstructured) multithreaded computations on parallel computers. A popular and practical method of sche...
135
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...
126
click to vote
CP
2004
Springer
15 years 9 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
128
click to vote
FPGA
2003
ACM
15 years 9 months ago
2003
ACM
We present a pipelining-aware router for FPGAs. The problem of routing pipelined signals is different from the conventional FPGA routing problem. For example, the two terminal N-D...