Sciweavers

3001 search results - page 129 / 601
» Recursive type generativity
Sort
View
FLOPS
2010
Springer
15 years 11 months ago
Tag-Free Combinators for Binding-Time Polymorphic Program Generation
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
Peter Thiemann, Martin Sulzmann
FPL
2006
Springer
127views Hardware» more  FPL 2006»
15 years 9 months ago
FPGA Vendor Agnostic True Random Number Generator
This paper describes a solution for the generation of true random numbers in a purely digital fashion; making it suitable for any FPGA type, because no FPGA vendor specific featur...
Dries Schellekens, Bart Preneel, Ingrid Verbauwhed...
APVIS
2006
15 years 7 months ago
Generation of relevance maps and navigation in a digital book
This paper describes how to design a digital book for a new science called `Knowledge Science'. We prepare several types of navigation facilities for browsing the book. Speci...
Katsuhiro Ikeda, Kozo Sugiyama, Isamu Watanabe, Ka...
AIED
2009
Springer
16 years 22 days ago
Combining Evaluative and Generative Diagnosis in ACTIVEMATH
Generative and evaluative approaches are two different ways of diagnosing students’ input that have been realized in a number of intelligent tutoring systems. We describe how Ac...
George Goguadze, Erica Melis
DATE
2010
IEEE
76views Hardware» more  DATE 2010»
15 years 11 months ago
Scalable codeword generation for coupled buses
—Inductive and capacitive coupling are responsible for slowing down signals. Existing bus encoding techniques tackle the issue by avoiding certain types of transitions. This work...
Kedar Karmarkar, Spyros Tragoudas