Sciweavers

2976 search results - page 59 / 596
» On the bounded integer programming
Sort
View
TIT
2002
72views more  TIT 2002»
13 years 9 months ago
Universal codes for finite sequences of integers drawn from a monotone distribution
We offer two noiseless codes for blocks of integers Xn = (X1, . . . , Xn). We provide explicit bounds on the relative redundancy that are valid for any distribution F in the class...
Dean P. Foster, Robert A. Stine, Abraham J. Wyner
JSAT
2006
88views more  JSAT 2006»
13 years 10 months ago
On Using Cutting Planes in Pseudo-Boolean Optimization
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
Vasco M. Manquinho, João P. Marques Silva
PSD
2010
Springer
109views Database» more  PSD 2010»
13 years 8 months ago
A Tool for Analyzing and Fixing Infeasible RCTA Instances
Minimum-distance controlled tabular adjustment methods (CTA), and its restricted variants (RCTA), is a recent perturbative approach for tabular data protection. Given a table to be...
Jordi Castro, José A. González
SARA
2009
Springer
14 years 4 months ago
Tightened Transitive Closure of Integer Addition Constraints
We present algorithms for testing the satisfiability and finding the tightened transitive closure of conjunctions of addition constraints of the form ±x ± y ≤ d and bound co...
Peter Z. Revesz
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 10 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard