121 search results - page 7 / 25 » Random Assignment with Integer Costs |
93
Voted
ISPD
2004
ACM
15 years 2 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
CP
2004
Springer
15 years 2 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...
105
click to vote
MOR
2000
14 years 9 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
81
Voted
DLT
2004
14 years 11 months ago
2004
We study the maximum function of any R+-rational formal series S in two commuting variables, which assigns to every integer n N, the maximum coefficient of the monomials of degree...
SIGSOFT
1995
ACM
15 years 1 months ago
1995
ACM
—We conducted a long-term experiment to compare the costs and benefits of several different software inspection methods. These methods were applied by professional developers to ...