Sciweavers

5372 search results - page 262 / 1075
» complexity 2007
Sort
View
COCO
2007
Springer
87views Algorithms» more  COCO 2007»
14 years 2 months ago
Parity Problems in Planar Graphs
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
Mark Braverman, Raghav Kulkarni, Sambuddha Roy
CONCUR
2007
Springer
14 years 2 months ago
A Marriage of Rely/Guarantee and Separation Logic
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...
Viktor Vafeiadis, Matthew J. Parkinson
ECTEL
2007
Springer
14 years 2 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...
ECTEL
2007
Springer
14 years 2 months ago
Distilling Lessons from across Different Types of e-learning Interventions
Most Higher Education institutions are now embracing e-learning to some extent. Some have instigated institution-wide e-learning initiatives, whilst others are engaging in the use ...
Grainne Conole
ESWS
2007
Springer
14 years 2 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...