1144 search results - page 80 / 229 » Logic programming for combinatorial problems |
139
click to vote
SAC
2006
ACM
15 years 2 months ago
2006
ACM
Many combinatorial optimization problems in biosequence analysis are solved via dynamic programming. To increase programming productivity and program reliability, a domain specifi...
112
Voted
RANDOM
2001
Springer
15 years 6 months ago
2001
Springer
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
121
click to vote
CP
2004
Springer
15 years 6 months ago
2004
Springer
Many combinatorial (optimisation) problems have natural models based on, or including, set variables and set constraints. This was already known to the constraint programming commu...
122
click to vote
RWEB
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Answer Set Programming (ASP) is a declarative problem solving paradigm, rooted in Logic Programming and Nonmonotonic Reasoning, which has been gaining increasing attentio...
ANOR
2002
15 years 2 months ago
2002
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...