146 search results - page 26 / 30 » The Complexity of Integer Bound Propagation |
CCE
2005
14 years 9 months ago
2005
This paper presents a continuous-time mathematical formulation for freshwater and wastewater minimisation in multipurpose batch plants with and without a central reusable water st...
116
click to vote
SODA
2010
ACM
15 years 7 months ago
2010
ACM
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
FOCS
2007
IEEE
15 years 1 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
TOPLAS
2008
14 years 9 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...