8201 search results - page 1388 / 1641 » Approaching Manual Intelligence |
170
Voted
CP
2007
Springer
16 years 26 days ago
2007
Springer
It has been widely observed that there is no “dominant” SAT solver; instead, different solvers perform best on different instances. Rather than following the traditional appr...
164
click to vote
CP
2007
Springer
16 years 26 days ago
2007
Springer
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...
176
Voted
CP
2007
Springer
16 years 26 days ago
2007
Springer
The increasing levels of system integration in Multi-Processor System-on-Chips (MPSoCs) emphasize the need for new design flows for efficient mapping of multi-task applications o...
148
Voted
CP
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...
160
click to vote
EPIA
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. In this work, a Simulated Annealing (SA) algorithm is proposed for a Metabolic Engineering task: the optimization of the set of gene deletions to apply to a microbial str...