Sciweavers

932 search results - page 59 / 187
» Analysis and Optimization of CHR Programs
Sort
View
IJCV
2002
129views more  IJCV 2002»
13 years 8 months ago
A Hierarchical Symmetric Stereo Algorithm Using Dynamic Programming
In this paper, a new hierarchical stereo algorithm is presented. The algorithm matches individual pixels in corresponding scanlines by minimizing a cost function. Several cost fun...
G. Van Meerbergen, Maarten Vergauwen, Marc Pollefe...
LPNMR
1997
Springer
14 years 26 days ago
Improving the Alternating Fixpoint: The Transformation Approach
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...
Ulrich Zukowski, Burkhard Freitag, Stefan Brass
GECCO
2004
Springer
14 years 2 months ago
Multi-branches Genetic Programming as a Tool for Function Approximation
This work presents a performance analysis of a Multi-Branches Genetic Programming (MBGP) approach applied in symbolic regression (e.g. function approximation) problems. Genetic Pro...
Katya Rodríguez-Vázquez, Carlos Oliv...
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 6 months ago
XSB: Extending Prolog with Tabled Logic Programming
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this ar...
Terrance Swift, David Scott Warren
POPL
2010
ACM
14 years 3 months ago
Compress-and-conquer for optimal multicore computing
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
Zhijing G. Mou, Hai Liu, Paul Hudak