3367 search results - page 236 / 674 » Incremental assignment problem |
144
click to vote
IPSN
2004
Springer
15 years 9 months ago
2004
Springer
Wireless sensor networks are capable of collecting an enormous amount of data over space and time. Often, the ultimate objective is to derive an estimate of a parameter or functio...
181
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
151
click to vote
CONSTRAINTS
2006
15 years 3 months ago
2006
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
145
click to vote
ASPDAC
2006
ACM
15 years 9 months ago
2006
ACM
− In this paper, we present a new timing-driven placement algorithm, which attempts to minimize zigzags and crisscrosses on the timing-critical paths of a circuit. We observed th...
152
Voted
JSAC
2006
15 years 3 months ago
2006
In this paper, we consider the problem of allocating bandwidth to two queues with arbitrary arrival processes, so as to minimize the total expected packet holding cost over a finit...