Sciweavers

3844 search results - page 60 / 769
» Modular interpreted systems
Sort
View
RTA
2010
Springer
15 years 3 months ago
Modular Complexity Analysis via Relative Complexity
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
Harald Zankl, Martin Korp
CC
2002
Springer
173views System Software» more  CC 2002»
14 years 11 months ago
Building an Interpreter with Vmgen
Vmgen automates many of the tasks of writing the virtual machine part of an interpreter, resulting in less coding, debugging and maintenance e ort. This paper gives some quantitati...
M. Anton Ertl, David Gregg
CADE
1992
Springer
15 years 4 months ago
Polynomial Interpretations and the Complexity of Algorithms
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
Adam Cichon, Pierre Lescanne
IJCAI
2001
15 years 1 months ago
Efficient Interpretation Policies
Many imaging systems seek a good interpretation of the scene presented -- i.e., a plausible (perhaps optimal) mapping from aspects of the scene to real-world objects. This paper a...
Ramana Isukapalli, Russell Greiner
KI
2010
Springer
14 years 10 months ago
An Extensible Modular Recognition Concept That Makes Activity Recognition Practical
Abstract. In mobile and ubiquitous computing, there is a strong need for supporting different users with different interests, needs, and demands. Activity recognition systems for c...
Martin Berchtold, Matthias Budde, Hedda Rahel Schm...