Sciweavers

836 search results - page 128 / 168
» Description logic programs: combining logic programs with de...
Sort
View
ICFP
2007
ACM
16 years 6 months ago
A generic usage analysis with subeffect qualifiers
Sharing analysis and uniqueness typing are static analyses that aim at determining which of a program's objects are to be used at most once. There are many commonalities betw...
Jurriaan Hage, Stefan Holdermans, Arie Middelkoop
CP
2007
Springer
16 years 7 days ago
The Log-Support Encoding of CSP into SAT
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
Marco Gavanelli
GECCO
2005
Springer
196views Optimization» more  GECCO 2005»
15 years 11 months ago
Providing information from the environment for growing electronic circuits through polymorphic gates
This paper deals with the evolutionary design of programs (constructors) that are able to create (n+2)-input circuits from n-input circuits. The growing circuits are composed of p...
Michal Bidlo, Lukás Sekanina
ISLPED
2004
ACM
169views Hardware» more  ISLPED 2004»
15 years 11 months ago
Delay optimal low-power circuit clustering for FPGAs with dual supply voltages
This paper presents a delay optimal FPGA clustering algorithm targeting low power. We assume that the configurable logic blocks of the FPGA can be programmed using either a high s...
Deming Chen, Jason Cong
HIPC
2004
Springer
15 years 11 months ago
A Parallel State Assignment Algorithm for Finite State Machines
This paper summarizes the design and implementation of a parallel algorithm for state assignment of large Finite State Machines (FSMs). High performance CAD tools are necessary to...
David A. Bader, Kamesh Madduri