7092 search results - page 233 / 1419 » Parallelizing constraint programs |
146
click to vote
ASP
2001
Springer
15 years 6 months ago
2001
Springer
Answer-set programming (ASP) solvers must handle difficult computational problems that are NP-hard. These solvers are in the worst case exponential and their scope of applicabilit...
128
click to vote
VLSID
2002
IEEE
16 years 2 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
113
Voted
ICFP
2007
ACM
16 years 2 months ago
2007
ACM
In this paper we present an automated way of using spare CPU resources within a shared memory multi-processor or multi-core machine. Our approach is (i) to profile the execution o...
105
Voted
CP
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We study the global cardinality constraint (gcc) and pro
115
click to vote
IWFM
1998
15 years 3 months ago
1998
The issue of correctness in the context of a certain style of program transformation is investigated. This style is characterised by the fully automated application of large numbe...