2976 search results - page 259 / 596 » On the bounded integer programming |
163
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
134
click to vote
FMCO
2007
Springer
15 years 11 months ago
2007
Springer
This paper describes the architecture of costa, an abstract interpretation based cost and termination analyzer for Java bytecode. The system receives as input a bytecode program, (...
150
click to vote
ICDT
1995
ACM
15 years 8 months ago
1995
ACM
Following results are sketched in this extended abstract: (1) Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded, wit...
157
click to vote
ICCD
2008
IEEE
16 years 2 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...
135
click to vote
CVPR
2010
IEEE
16 years 27 days 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...