Sciweavers

2076 search results - page 107 / 416
» Functional logic overloading
Sort
View
POPL
2008
ACM
14 years 9 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
APCSAC
2004
IEEE
14 years 19 days ago
Dynamic Reallocation of Functional Units in Superscalar Processors
In the context of general-purpose processing, an increasing number of diverse functional units are added to cover a wide spectrum of applications. However, it is still possible to ...
Marc Epalza, Paolo Ienne, Daniel Mlynek
ASIAN
2006
Springer
118views Algorithms» more  ASIAN 2006»
14 years 18 days ago
An Approach to Formal Verification of Arithmetic Functions in Assembly
Abstract. It is customary to write performance-critical parts of arithmetic functions in assembly: this enables finely-tuned algorithms that use specialized processor instructions....
Reynald Affeldt, Nicolas Marti
DAGSTUHL
2004
13 years 10 months ago
Testing with Functions as Specifications
Although computer systems penetrate all facets of society, the software running those systems may contain many errors. Producing high quality software appears to be difficult and v...
Pieter W. M. Koopman
FECS
2006
159views Education» more  FECS 2006»
13 years 10 months ago
Evolving Mathematical Functions with Genetic Algorithms - A Team Project on Artificial Intelligence
- In contrast to most of the senior level Artificial Intelligence (AI) courses where AI is taught in the jargon of theoretical computer science with crowd of complex matrix algebra...
Zhiguang Xu, Chris Neasbitt, Jared Summers, Bill C...