Sciweavers

3546 search results - page 551 / 710
» A Causal Logic of Logic Programming
Sort
View
LOPSTR
2001
Springer
14 years 2 months ago
On Deforesting Parameters of Accumulating Maps
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...
Kazuhiko Kakehi, Robert Glück, Yoshihiko Futa...
AGP
1999
IEEE
14 years 2 months ago
Widening Sharing
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...
Enea Zaffanella, Roberto Bagnara, Patricia M. Hill
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
13 years 10 months ago
Fitness importance for online evolution
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...
Philip Valencia, Raja Jurdak, Peter Lindsay
PPOPP
2009
ACM
14 years 11 months ago
Serialization sets: a dynamic dependence-based parallel execution model
This paper proposes a new parallel execution model where programmers augment a sequential program with pieces of code called serializers that dynamically map computational operati...
Matthew D. Allen, Srinath Sridharan, Gurindar S. S...
ICFP
2006
ACM
14 years 10 months ago
A technique for generic iteration and its optimization
Software libraries rely increasingly on iterators to provide generic traversal of data structures. These iterators can be represented either as objects that maintain state or as p...
Stephen M. Watt