743 search results - page 114 / 149 » Optimal Abstraction on Real-Valued Programs |
ICLP
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Bottom-up evaluation is a central part of query evaluation / program execution in deductive databases. It is used after a source code optimization like magic sets or SLDm...
HOTOS
2007
IEEE
15 years 1 months ago
2007
IEEE
As multi-core processors with tens or hundreds of cores begin to proliferate, system optimization issues once faced only by the high-performance computing (HPC) community will bec...
ICCAD
1995
IEEE
15 years 1 months ago
1995
IEEE
Abstract—We propose the use of the logic S1S as a mathematical framework for studying the synthesis of sequential designs. We will show that this leads to simple and mathematical...
CPAIOR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
108
click to vote
IPCO
2008
14 years 11 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...