Sciweavers

4940 search results - page 722 / 988
» On the Complexity of Universal Programs
Sort
View
AIED
2007
Springer
16 years 23 days ago
Using Ontologies for an Effective Design of Collaborative Learning Activities
Although artificial intelligence has been successfully introduced to enhance Education through technologies in the past few years, major challenges still remain. One of them is how...
Seiji Isotani, Riichiro Mizoguchi
CC
2007
Springer
208views System Software» more  CC 2007»
16 years 22 days ago
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
Bernhard Scholz, Johann Blieberger
ESWS
2007
Springer
16 years 22 days ago
Minimal Deductive Systems for RDF
Abstract. This paper presents a minimalist program for RDF, by showing how one can do without several predicates and keywords of the RDF Schema vocabulary, obtaining a simpler lang...
Sergio Muñoz, Jorge Pérez, Claudio G...
EUROPAR
2007
Springer
16 years 22 days ago
Starvation-Free Transactional Memory-System Protocols
Abstract. Transactional memory systems trade ease of programming with runtime performance losses in handling transactions. This paper focuses on starvation effects that show up in ...
M. M. Waliullah, Per Stenström
FOSSACS
2007
Springer
16 years 22 days ago
Logical Reasoning for Higher-Order Functions with Local State
Abstract. We introduce an extension of Hoare logic for call-by-value higherorder functions with ML-like local reference generation. Local references may be generated dynamically an...
Nobuko Yoshida, Kohei Honda, Martin Berger