168 search results - page 16 / 34 » A Generalization of Hybrid Let-Polymorphic Type Inference Al... |
RTSS
1998
IEEE
13 years 11 months ago
1998
IEEE
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
ECOOP
2010
Springer
14 years 9 days ago
2010
Springer
Abstract. With the current surge of scripting technologies, large programs are being built with dynamically typed languages. As these programs grow in size, semantics-based tools g...
CSDA
2007
13 years 7 months ago
2007
Recently, there has been a considerable interest in finite mixture models with semi-/non-parametric component distributions. Identifiability of such model parameters is generall...
DAC
2006
ACM
14 years 8 months ago
2006
ACM
In this paper, we propose an adaptive low-power bus encoding algorithm based on weighted code mapping (WCM) and the delayed bus technique. The WCM algorithm transforms an original...
POPL
2007
ACM
14 years 7 months ago
2007
ACM
ML modules and Haskell type classes have proven to be highly effective tools for program structuring. Modules emphasize explicit configuration of program components and the use of...