260 search results - page 10 / 52 » Range and Set Abstraction using SAT |
FPGA
2009
ACM
14 years 2 months ago
2009
ACM
We describe an optimization method for combinational and sequential logic networks, with emphasis on scalability and the scope of optimization. The proposed resynthesis (a) is cap...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
BIBE
2004
IEEE
13 years 11 months ago
2004
IEEE
Large-scale biomedical data sets of macromolecular structures such as DNA and proteins describe highly complex biomolecular entities which often consist of thousands of atoms and ...
LION
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
MOBIHOC
2008
ACM
14 years 7 months ago
2008
ACM
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...