Sciweavers

804 search results - page 73 / 161
» On the Termination of the Chase Algorithm
Sort
View
105
Voted
ICFP
2005
ACM
15 years 6 months ago
Fast narrowing-driven partial evaluation for inductively sequential programs
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
WICOMM
2008
122views more  WICOMM 2008»
15 years 13 days ago
Energy and connectivity performance of routing groups in multi-radio multi-hop networks
This paper explores the logical device aggregation of terminals in future generation networks, where the availability of several different radio access techniques is integrated by...
Michele Rossi, Leonardo Badia, Paolo Giacon, Miche...
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
14 years 10 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...
143
Voted
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
14 years 10 months ago
Genetic programming for quantitative stock selection
We provide an overview of using genetic programming (GP) to model stock returns. Our models employ GP terminals (model decision variables) that are financial factors identified by...
Ying L. Becker, Una-May O'Reilly
82
Voted
POPL
2012
ACM
13 years 8 months ago
Recursive proofs for inductive tree data-structures
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...