Sciweavers

Share
161 search results - page 1 / 33
» Lazy call-by-value evaluation
Sort
View
ICML
2003
IEEE
13 years 15 days ago
Boosting Lazy Decision Trees
This paper explores the problem of how to construct lazy decision tree ensembles. We present and empirically evaluate a relevancebased boosting-style algorithm that builds a lazy ...
Xiaoli Zhang Fern, Carla E. Brodley
DFT
2007
IEEE
103views VLSI» more  DFT 2007»
12 years 6 months ago
Lazy Error Detection for Microprocessor Functional Units
We propose and evaluate the use of lazy error detection for a superscalar, out-of-order microprocessor’s functional units. The key insight is that error detection is off the cri...
Mahmut Yilmaz, Albert Meixner, Sule Ozev, Daniel J...
ICFP
2003
ACM
12 years 11 months ago
Optimistic evaluation: an adaptive evaluation strategy for non-strict programs
Lazy programs are beautiful, but they are slow because they build many thunks. Simple measurements show that most of these thunks are unnecessary: they are in fact always evaluate...
Robert Ennals, Simon L. Peyton Jones
SIGMOD
2005
ACM
154views Database» more  SIGMOD 2005»
12 years 12 months ago
Lazy XML Updates: Laziness as a Virtue of Update and Structural Join Efficiency
XML documents are normally stored as plain text files. Hence, the natural and most convenient way to update XML documents is to simply edit the text files. But efficient query eva...
Barbara Catania, Wen Qiang Wang, Beng Chin Ooi, Xi...
LOPSTR
2007
Springer
12 years 5 months ago
Preserving Sharing in the Partial Evaluation of Lazy Functional Programs
Abstract. The goal of partial evaluation is the specialization of programs w.r.t. part of their input data. Although this technique is already well-known in the context of function...
Sebastian Fischer, Josep Silva, Salvador Tamarit, ...
books