Sciweavers

4940 search results - page 677 / 988
» On the Complexity of Universal Programs
Sort
View
FCCM
2000
IEEE
105views VLSI» more  FCCM 2000»
15 years 11 months ago
Configuration Relocation and Defragmentation for Reconfigurable Computing
Custom computing systems exhibit significant speedups over traditional microprocessors by mapping compute-intensive sections of a program to reconfigurable logic [Hauck98]. Howeve...
Katherine Compton, James Cooley, Stephen Knol, Sco...
TOOLS
2000
IEEE
15 years 11 months ago
A Case Study of Framework Design for Horizontal Reuse
In this experience report we present a case study in designing, implementing, and reusing an object-oriented framework for constructing and editing complex search expressions over...
Henrik Bærbak Christensen, Hebrick Rø...
TOOLS
2000
IEEE
15 years 11 months ago
More Meaningful UML Models
UML is widely used today for modelling complex systems. However, the tools support capabilities for UML is limited, partially due to its lack of precise semantics. There are some ...
Ileana Ober
PLDI
2000
ACM
15 years 11 months ago
Exploiting superword level parallelism with multimedia instruction sets
Increasing focus on multimedia applications has prompted the addition of multimedia extensions to most existing general purpose microprocessors. This added functionality comes pri...
Samuel Larsen, Saman P. Amarasinghe
ECAI
2000
Springer
15 years 11 months ago
Lazy Propositionalisation for Relational Learning
A number of Inductive Logic Programming (ILP) systems have addressed the problem of learning First Order Logic (FOL) discriminant definitions by first reformulating the FOL lear...
Érick Alphonse, Céline Rouveirol