Sciweavers

1445 search results - page 192 / 289
» Uniformly Hard Languages
Sort
View
ICFP
1999
ACM
15 years 8 months ago
Type Inference Builds a Short Cut to Deforestation
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
Olaf Chitil
CF
2006
ACM
15 years 6 months ago
Intermediately executed code is the key to find refactorings that improve temporal data locality
The growing speed gap between memory and processor makes an efficient use of the cache ever more important to reach high performance. One of the most important ways to improve cac...
Kristof Beyls, Erik H. D'Hollander
WOTUG
2007
15 years 5 months ago
A Process Oriented Approach to USB Driver Development
Abstract. Operating-systems are the core software component of many modern computer systems, ranging from small specialised embedded systems through to large distributed operating-...
Carl G. Ritson, Fred R. M. Barnes
ECCC
2007
115views more  ECCC 2007»
15 years 4 months ago
A (De)constructive Approach to Program Checking
Program checking, program self-correcting and program selftesting were pioneered by [Blum and Kannan] and [Blum, Luby and Rubinfeld] in the mid eighties as a new way to gain con...
Shafi Goldwasser, Dan Gutfreund, Alexander Healy, ...
118
Voted
IJFCS
2007
105views more  IJFCS 2007»
15 years 4 months ago
On the Existence of Lookahead Delegators for NFA
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...
Bala Ravikumar, Nicolae Santean