Sciweavers

160 search results - page 20 / 32
» Satisfiability-Based Algorithms for Boolean Optimization
Sort
View
CODES
2009
IEEE
15 years 22 days ago
Efficient dynamic voltage/frequency scaling through algorithmic loop transformation
We present a novel loop transformation technique, particularly well suited for optimizing embedded compilers, where an increase in compilation time is acceptable in exchange for s...
Mohammad Ali Ghodrat, Tony Givargis
ISMVL
2008
IEEE
160views Hardware» more  ISMVL 2008»
15 years 6 months ago
Exact Synthesis of Elementary Quantum Gate Circuits for Reversible Functions with Don't Cares
Compact realizations of reversible logic functions are of interest in the design of quantum computers. In this paper we present an exact synthesis algorithm, based on Boolean Sati...
Daniel Große, Robert Wille, Gerhard W. Dueck...
CVPR
2009
IEEE
16 years 6 months ago
Learning query-dependent prefilters for scalable image retrieval
We describe an algorithm for similar-image search which is designed to be efficient for extremely large collections of images. For each query, a small response set is selected by...
Lorenzo Torresani (Dartmouth College), Martin Szum...
COCO
2006
Springer
96views Algorithms» more  COCO 2006»
15 years 3 months ago
Optimal Hardness Results for Maximizing Agreements with Monomials
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
Vitaly Feldman
COCO
2000
Springer
161views Algorithms» more  COCO 2000»
15 years 4 months ago
Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
Ronald de Wolf