Sciweavers

1418 search results - page 39 / 284
» The Dynamic Complexity of Formal Languages
Sort
View
ICALP
2000
Springer
15 years 5 months ago
Average Bit-Complexity of Euclidean Algorithms
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
Ali Akhavi, Brigitte Vallée
FOIS
2006
15 years 3 months ago
Formalizing Ontology Alignment and its Operations with Category Theory
An ontology alignment is the expression of relations between different ontologies. In order to view alignments independently from the language expressing ontologies and from the te...
Antoine Zimmermann, Markus Krötzsch, Jé...
110
Voted
ECTEL
2007
Springer
15 years 8 months ago
Integration in Generic Tool Learning Design to Support Complex Learning Methodologies
: Current learning modelling languages do not allow formalization of scripts where generic tools are required. This limitation is especially relevant on remote courses when using c...
Luis de la Fuente Valentín
SAC
2011
ACM
14 years 4 months ago
Type harvesting: a practical approach to obtaining typing information in dynamic programming languages
Dynamically typed programming languages are powerful tools for rapid software development. However, there are scenarios that would benefit from actual type information being avai...
Michael Haupt, Michael Perscheid, Robert Hirschfel...
124
Voted
TOOLS
2008
IEEE
15 years 8 months ago
An AsmL Semantics for Dynamic Structures and Run Time Schedulability in UML-RT
Abstract. Many real-time systems use runtime structural reconfiguration mechanisms based on dynamic creation and destruction of components. To support such features, UML-RT provid...
Stefan Leue, Alin Stefanescu, Wei Wei