Sciweavers

1157 search results - page 176 / 232
» Solving iterated functions using genetic programming
Sort
View
LPAR
1999
Springer
15 years 7 months ago
Extensions to the Estimation Calculus
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...
Jeremy Gow, Alan Bundy, Ian Green
126
Voted
PLDI
2004
ACM
15 years 9 months ago
Inducing heuristics to decide whether to schedule
Instruction scheduling is a compiler optimization that can improve program speed, sometimes by 10% or more—but it can also be expensive. Furthermore, time spent optimizing is mo...
John Cavazos, J. Eliot B. Moss
ECBS
2002
IEEE
146views Hardware» more  ECBS 2002»
15 years 8 months ago
Top-Down Composition of Software Architectures
This paper discusses an approach for top-down composition of software architectures. First, an architecture is derived that addresses functional requirements only. This architectu...
Hans de Bruin, Hans van Vliet
VLDB
1987
ACM
93views Database» more  VLDB 1987»
15 years 7 months ago
FAD, a Powerful and Simple Database Language
FAD is a powerful and simple language designed for a highly parallel database machine. The basic concepts of the language are its data structures (which we call objects) and its p...
François Bancilhon, Ted Briggs, Setrag Khos...
ENTCS
2008
121views more  ENTCS 2008»
15 years 3 months ago
Building Certified Static Analysers by Modular Construction of Well-founded Lattices
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
David Pichardie