2976 search results - page 113 / 596 » On the bounded integer programming |
129
Voted
DCG
2007
15 years 5 months ago
2007
In this paper we investigate the Erd¨os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We pr...
128
Voted
EJC
2007
15 years 5 months ago
2007
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n ...
137
Voted
ASAP
2004
IEEE
15 years 8 months ago
2004
IEEE
The Compaan compiler automatically derives a Process Network (PN) description from an application written in Matlab. The basic element of a PN is a Producer/Consumer (P/C) pair. F...
129
click to vote
IPCO
2007
15 years 6 months ago
2007
We introduce orbital branching, an effective branching method for integer programs containing a great deal of symmetry. The method is based on computing groups of variables that a...
142
click to vote
ESOP
2010
Springer
15 years 11 months ago
2010
Springer
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs....