Sciweavers

1359 search results - page 32 / 272
» Black-Box Program Specialization
Sort
View
ASP
2003
Springer
14 years 1 months ago
Using Nested Logic Programs for Answer Set Programming
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
Thomas Linke
EPS
1995
Springer
14 years 6 days ago
Evolving the Architecture of a Multi-part Program in Genetic Programming Using Architecture-Altering Operations
: This paper describes six new architecture-altering operations that provide a way to dynamically determine the architecture of a multipart program during a run of genetic programm...
John R. Koza
SAC
2009
ACM
14 years 3 months ago
A comparative study of techniques to write customizable libraries
Code libraries are characterized by feature-richness — and, consequently, high overhead. The library specialization problem is the problem of obtaining a low-overhead version of...
Baris Aktemur, Sam Kamin
CORR
2007
Springer
82views Education» more  CORR 2007»
13 years 8 months ago
Programs as polygraphs: computability and complexity
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
Guillaume Bonfante, Yves Guiraud
ICALP
2001
Springer
14 years 1 months ago
On the Approximability of Average Completion Time Scheduling under Precedence Constraints
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
Gerhard J. Woeginger