178 search results - page 10 / 36 » Splitting a CR-Prolog Program |
PPAM
2007
Springer
14 years 2 months ago
2007
Springer
There are several parallel programming models available for numerical computations at diļ¬erent levels of expressibility and ease of use. For the development of new domain speciļ¬...
CPAIOR
2010
Springer
14 years 22 days ago
2010
Springer
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
ENTCS
2008
13 years 8 months ago
2008
We report in this paper on the formal verification of a simple compiler for the C-like programming language C0. The compiler correctness proof meets the special requirements of pe...
Publication
This paper describes the structure of, and the ideas behind, a self-applicable specializer of programs, as well as the principles of operation of a compiler generator that has been...
CP
2003
Springer
14 years 1 months ago
2003
Springer
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based ļ¬ltering algorit...