1144 search results - page 185 / 229 » Logic programming for combinatorial problems |
LOPSTR
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...
AGP
1999
IEEE
14 years 23 hour ago
1999
IEEE
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither aring nor its non-redundant (but equivalent) abstra...
GECCO
2010
Springer
13 years 7 months ago
2010
Springer
To complement standard fitness functions, we propose "Fitness Importance" (FI) as a novel meta-heuristic for online learning systems. We define FI and show how it can be...
IJFCS
2006
13 years 7 months ago
2006
The outcome of verifying software is often a `counterexample', i.e., a listing of the actions and states of a behavior not satisfying the specification. In order to understan...
CACM
2010
13 years 5 months ago
2010
Certified software consists of a machine-executable program plus a formal machine-checkable proof that the software is free of bugs with respect to a claim of dependability. The c...