2976 search results - page 127 / 596 » On the bounded integer programming |
AMAI
2008
Springer
15 years 23 days ago
2008
Springer
The paper studies the relationship between logic programs with the stable model semantics and difference logic recently considered in the Satisfiability Modulo Theories framework....
80
Voted
APVIS
2004
15 years 2 months ago
2004
We describe a modelling language, called XML:LP, for presenting linear and integer programs in XML, with related tools for displaying models and their solutions in web browsers. O...
111
Voted
LPAR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis...
96
Voted
NETWORKS
2008
15 years 17 days ago
2008
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
101
click to vote
COCOON
2001
Springer
15 years 5 months ago
2001
Springer
We consider one-dimensional and multi-dimensional vector covering with variable sized bins. In the one-dimensional case, we consider variable sized bin covering with bounded item ...