224 search results - page 3 / 45 » G-graphs for the cage problem: a new upper bound |
133
click to vote
CP
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
141
click to vote
COCOON
2004
Springer
15 years 11 months ago
2004
Springer
This paper studies the on-demand broadcasting problem with deadlines. We give the first general upper bound and improve existing lower bounds on the com
165
click to vote
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
122
click to vote
AAECC
2006
Springer
16 years 1 days ago
2006
Springer
Abstract. We examine the well-known problem of determining the capacity of multi-dimensional run-length-limited constrained systems. By recasting the problem, which is essentially ...
148
click to vote
SAT
2007
Springer
16 years 4 days ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...