2976 search results - page 149 / 596 » On the bounded integer programming |
109
click to vote
BIRTHDAY
2009
Springer
15 years 9 months ago
2009
Springer
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
123
click to vote
SODA
2000
ACM
15 years 4 months ago
2000
ACM
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...
108
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Abstract. We present a deep embedding of Bellantoni and Cook’s syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to...
121
click to vote
ICTAI
1996
IEEE
15 years 7 months ago
1996
IEEE
The goal of this work is to derive four-voice music pieces from given musical plans, which describe the harmonic flow and the intentions of a desired composition. We developed the...
143
click to vote
ANOR
2011
14 years 10 months ago
2011
Abstract. Scheduling problems in the forest industry have received significant attention in the recent years and have contributed many challenging applications for optimization te...