1274 search results - page 114 / 255 » N-fold integer programming |
199
Voted
POPL
2011
ACM
14 years 5 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
128
Voted
ICCD
2008
IEEE
15 years 11 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...
108
Voted
CVPR
2010
IEEE
15 years 10 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...
137
click to vote
WEA
2010
Springer
15 years 9 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 ...
126
click to vote
COCOA
2007
Springer
15 years 8 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...