1707 search results - page 148 / 342 » Early Integer Programming |
116
Voted
ICCD
2008
IEEE
15 years 9 months ago
2008
IEEE
- In this paper, we analyze the impact of network contention on the application mapping for tile-based Networkon-Chip (NoC) architectures. Our main theoretical contribution consist...
97
Voted
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
119
Voted
WEA
2010
Springer
15 years 7 months ago
2010
Springer
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
108
click to vote
COCOA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
CP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. One of the most successful approaches in automated planning is to use heuristic state-space search. A popular heuristic that is used by a number of state-space planners i...