407 search results - page 13 / 82 » Optimization of Linear Logic Programs Using Counting Methods |
JAPLL
2006
13 years 7 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
SIAMCOMP
2000
13 years 7 months ago
2000
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
Recently, a form of memory usage was introduced for genetic programming (GP) called “soft memory.” Rather than have a new value completely overwrite the old value in a registe...
ISCAS
2003
IEEE
14 years 24 days ago
2003
IEEE
Since Limís 1986 paper on the frequency-response masking (FRM) technique for the design of FIR digital Ýlters with very small transition widths, the analysis and design of FRM ...
ICCAD
2008
IEEE
14 years 4 months ago
2008
IEEE
This paper presents new methods for restructuring logic networks based on fast Boolean techniques. The basis for these are 1) a cut based view of a logic network, 2) exploiting th...