Sciweavers

13 search results - page 2 / 3
» Cost Recurrences for DML Programs
Sort
View
WFLP
2000
Springer
124views Algorithms» more  WFLP 2000»
13 years 8 months ago
A Formal Approach to Reasoning about the Effectiveness of Partial Evaluation
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
Elvira Albert, Sergio Antoy, Germán Vidal
SC
2000
ACM
13 years 9 months ago
Scalable Algorithms for Adaptive Statistical Designs
We present a scalable, high-performance solution to multidimensional recurrences that arise in adaptive statistical designs. Adaptive designs are an important class of learning al...
Robert H. Oehmke, Janis Hardwick, Quentin F. Stout
ICAC
2005
IEEE
13 years 11 months ago
Quickly Finding Known Software Problems via Automated Symptom Matching
We present an architecture for and prototype of a system for quickly detecting software problem recurrences. Re-discovery of the same problem is very common in many large software...
Mark Brodie, Sheng Ma, Guy M. Lohman, Laurent Mign...
POPL
2006
ACM
14 years 5 months ago
Adventures in time and space
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
Norman Danner, James S. Royer
ICPP
1999
IEEE
13 years 9 months ago
Impact on Performance of Fused Multiply-Add Units in Aggressive VLIW Architectures
Loops are the main time consuming part of programs based on floating point computations. The performance of the loops is limited either by recurrences in the computation or by the...
David López, Josep Llosa, Eduard Ayguad&eac...