Sciweavers

949 search results - page 188 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
MEMOCODE
2006
IEEE
14 years 1 months ago
Latency-insensitive design and central repetitive scheduling
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
Julien Boucaron, Robert de Simone, Jean-Vivien Mil...
ACL
1994
13 years 8 months ago
Priority Union and Generalization in Discourse Grammars
We describe an implementation in Carpenter's typed feature formalism, ALE, of a discourse grammar of the kind proposed by Scha, Polanyi, et al. We examine their method for re...
Claire Grover, Chris Brew, Suresh Manandhar, Marc ...
WWW
2004
ACM
14 years 8 months ago
Authoring of learning styles in adaptive hypermedia: problems and solutions
Learning styles, as well as the best ways of responding with corresponding instructional strategies, have been intensively studied in the classical educational (classroom) setting...
Natalia Stash, Alexandra I. Cristea, Paul De Bra
FASE
2007
Springer
14 years 1 months ago
Declared Type Generalization Checker: An Eclipse Plug-In for Systematic Programming with More General Types
The Declared Type Generalization Checker is a plug-in for Eclipse’s Java Development Tools (JDT) that supports developers in systematically finding and using better fitting types...
Markus Bach, Florian Forster, Friedrich Steimann
IWCMC
2010
ACM
14 years 16 days ago
Estimating routing symmetry on single links by passive flow measurements
The assumption of routing symmetry is often embedded into traffic analysis and classification tools. This paper uses passively captured network data to estimate the amount of tra...
Wolfgang John, Maurizio Dusi, Kimberly C. Claffy