Sciweavers

2661 search results - page 234 / 533
» Quantum Complexity Classes
Sort
View
114
Voted
ECTEL
2007
Springer
15 years 10 months ago
Flexible Processes in Project-Centred Learning
Project-centred learning is increasingly used both in academia and in companies; universities train students to master complex tasks, often suggested by real-life situations, while...
Stefano Ceri, Maristella Matera, Alessandro Raffio...
ESWS
2007
Springer
15 years 10 months ago
Acquisition of OWL DL Axioms from Lexical Resources
State-of-the-art research on automated learning of ontologies from text currently focuses on inexpressive ontologies. The acquisition of complex axioms involving logical connective...
Johanna Völker, Pascal Hitzler, Philipp Cimia...
ICALP
2007
Springer
15 years 10 months ago
Parameterized Approximability of the Disjoint Cycle Problem
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
Martin Grohe, Magdalena Grüber
TACAS
2007
Springer
110views Algorithms» more  TACAS 2007»
15 years 10 months ago
Counterexamples in Probabilistic Model Checking
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
Tingting Han, Joost-Pieter Katoen
155
Voted
LICS
2006
IEEE
15 years 10 months ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson