Sciweavers

949 search results - page 20 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
FMICS
2009
Springer
13 years 11 months ago
On a Uniform Framework for the Definition of Stochastic Process Languages
In this paper we show how Rate Transition Systems (RTSs) can be used as a unifying framework for the definition of the semantics of stochastic process algebras. RTSs facilitate the...
Rocco De Nicola, Diego Latella, Michele Loreti, Mi...
EWDW
1990
13 years 11 months ago
Semantics of Object-Oriented Data Models - The Evolving Algebra Approach
The formal description of the semantics of object-oriented data models is still an open problem. Some characteristic features of object-oriented data models, such as methods and i...
Georg Gottlob, Gerti Kappel, Michael Schrefl
MOBISYS
2004
ACM
14 years 7 months ago
NWSLite: A Light-Weight Prediction Utility for Mobile Devices
Computation off-loading, i.e., remote execution, has been shown to be effective for extending the computational power and battery life of resource-restricted devices, e.g., hand-h...
Selim Gurun, Chandra Krintz, Richard Wolski
EKAW
2008
Springer
13 years 9 months ago
Learning Disjointness for Debugging Mappings between Lightweight Ontologies
Abstract. Dealing with heterogeneous ontologies by means of semantic mappings has become an important area of research and a number of systems for discovering mappings between onto...
Christian Meilicke, Johanna Völker, Heiner St...
GD
2009
Springer
13 years 5 months ago
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios V...