13026 search results - page 2366 / 2606 » Creativity and Artificial Intelligence |
171
Voted
CP
2007
Springer
16 years 27 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...
165
click to vote
CP
2007
Springer
16 years 27 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...
177
Voted
CP
2007
Springer
16 years 27 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...
151
Voted
CP
2007
Springer
16 years 27 days ago
2007
Springer
Visualization is often invaluable to understand the behavior of optimization algorithms, identify their bottlenecks or pathological behaviors, and suggest remedial techniques. Yet ...
203
Voted
CP
2007
Springer
16 years 27 days ago
2007
Springer
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...