10935 search results - page 2003 / 2187 » Neural Programming Language |
128
click to vote
CP
2007
Springer
16 years 10 days ago
2007
Springer
In this paper we argue that an attractive and potentially very general way of achieving generalized arc consistency (GAC) on a constraint is by using unit propagation (UP) over a C...
137
click to vote
CP
2007
Springer
16 years 10 days ago
2007
Springer
As SAT becomes more popular due to its ability to handle large real-world problems, progress in efficiency appears to have slowed down over the past few years. On the other hand, w...
160
click to vote
CP
2007
Springer
16 years 10 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...
150
Voted
CP
2007
Springer
16 years 10 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...
161
click to vote
CP
2007
Springer
16 years 10 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...