6102 search results - page 725 / 1221 » Generating Optimizing Specializers |
182
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
: In this paper, an algorithm for simultaneous logic restructuring and placement is presented. This algorithm first constructs a set of super-cells along the critical paths and the...
190
click to vote
CADE
1998
Springer
15 years 11 months ago
1998
Springer
The CRIL multi-strategy platform for SAT includes a whole family of local search techniques and some of the best Davis and Putnam strategies for checking propositional satis abilit...
218
click to vote
EPS
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. In Neo-Darwinism, mutation can be considered to be unaffected by selection pressure. This is the metaphor generally used by the genetic algorithm for its treatment of the...
191
click to vote
EURODAC
1994
IEEE
1994
IEEE
OSCAR: optimum simultaneous scheduling, allocation and resource binding based on integer programming
15 years 11 months ago
: This paper presents an approach to high-level synthesis which is based upon a 0/1 integer programming model. In contrast to other approaches, this model allows solving all three ...
165
click to vote
ITP
2010
15 years 11 months ago
2010
Abstract. The Satisfiability Modulo Theories (SMT) solver Z3 can generate proofs of unsatisfiability. We present independent reconstruction of these proofs in the theorem provers...