224 search results - page 37 / 45 » Algorithms for Solving Boolean Satisfiability in Combination... |
172
Voted
PEPM
2009
ACM
16 years 11 months ago
2009
ACM
The Verilog hardware description language has padding semantics that allow designers to write descriptions where wires of different bit widths can be interconnected. However, many ...
EH
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper describes a technique for evolving similar solutions to similar configuration design problems. Using the configuration design of combination logic circuits as a testb...
96
Voted
ICDT
2010
ACM
15 years 3 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
The purpose of this project is to develop a program that solves a bi-objective diet problem to propose the user a “healthy” daily meal according to some parameters specified b...
99
Voted
TKDE
2008
14 years 11 months ago
2008
Matrix decomposition methods represent a data matrix as a product of two smaller matrices: one containing basis vectors that represent meaningful concepts in the data, and another ...