Sciweavers

2214 search results - page 116 / 443
» complexity 2004
Sort
View
ANTS
2004
Springer
149views Algorithms» more  ANTS 2004»
14 years 2 months ago
A Binary Recursive Gcd Algorithm
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
Damien Stehlé, Paul Zimmermann
BPM
2004
Springer
101views Business» more  BPM 2004»
14 years 2 months ago
Consistency in Model Integration
State-of-the-art systems engineering uses many models reflecting various aspects of the modeled system. A major task of system engineers is to ensure consistency between the many...
Kees M. van Hee, Natalia Sidorova, Lou J. Somers, ...
CAISE
2004
Springer
14 years 2 months ago
Using Ontologies to Compose Transformations of XML Schema Based Documents
Abstract. We discuss how ontologies can be used to facilitate the construction of transformations between XML documents. We introduced a method to compose transformations for XML d...
Johann Eder, Christian Koncilia, Marek Lehmann, Ho...
CD
2004
Springer
14 years 2 months ago
MagicBeans: a Platform for Deploying Plugin Components
Abstract. Plugins are optional components which can be used to enable the dynamic construction of flexible and complex systems, passing as much of the configuration management ef...
Robert Chatley, Susan Eisenbach, Jeff Magee
CONCUR
2004
Springer
14 years 2 months ago
Model Checking Restricted Sets of Timed Paths
In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of rest...
Nicolas Markey, Jean-François Raskin