Sciweavers

2607 search results - page 223 / 522
» Complete Functional Synthesis
Sort
View
TCS
2002
15 years 3 months ago
Strictness, totality, and non-standard-type inference
In this paper we present two non-standard-type inference systems for conjunctive strictness and totality analyses of higher-order-typed functional programs and prove completeness ...
Mario Coppo, Ferruccio Damiani, Paola Giannini
DAC
2003
ACM
16 years 5 months ago
A scalable software-based self-test methodology for programmable processors
Software-based self-test (SBST) is an emerging approach to address the challenges of high-quality, at-speed test for complex programmable processors and systems-on chips (SoCs) th...
Li Chen, Srivaths Ravi, Anand Raghunathan, Sujit D...
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
15 years 10 months ago
Solving real-valued optimisation problems using cartesian genetic programming
Classical Evolutionary Programming (CEP) and Fast Evolutionary Programming (FEP) have been applied to realvalued function optimisation. Both of these techniques directly evolve th...
James Alfred Walker, Julian Francis Miller
ICCAD
2006
IEEE
190views Hardware» more  ICCAD 2006»
16 years 1 months ago
Factor cuts
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
ICCAD
2005
IEEE
147views Hardware» more  ICCAD 2005»
16 years 1 months ago
NoCEE: energy macro-model extraction methodology for network on chip routers
In this paper we present NoCEE, a fast and accurate method for extracting energy models for packet-switched Network on Chip (NoC) routers. Linear regression is used to model the r...
Jeremy Chan, Sri Parameswaran