2976 search results - page 167 / 596 » On the bounded integer programming |
184
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
In this paper, we show that for every constant 0 < < 1/2 and for every constant d 2, the minimum size of a depth d Boolean circuit that -approximates Majority function on n ...
139
click to vote
IPL
2008
15 years 6 months ago
2008
In this paper, we show how we can derive lower bounds and also compute the exact distortion for the line embeddings of some special metrics, especially trees and graphs with certai...
161
click to vote
PEPM
1998
ACM
15 years 10 months ago
1998
ACM
We show the evolution of partial evaluators over the past ten years from a particular perspective: the attempt to remove limits on the structure of residual programs that are inher...
279
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
166
Voted
SAS
2007
Springer
16 years 15 days ago
2007
Springer
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...