Sciweavers

3758 search results - page 298 / 752
» A Complete Subsumption Algorithm
Sort
View
WADS
2005
Springer
122views Algorithms» more  WADS 2005»
16 years 2 days ago
Parameterized Complexity of Generalized Vertex Cover Problems
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
WEA
2005
Springer
91views Algorithms» more  WEA 2005»
16 years 2 days ago
The Necessity of Timekeeping in Adversarial Queueing
We study queueing strategies in the adversarial queueing model. Rather than discussing individual prominent queueing strategies we tackle the issue on a general level and analyze c...
Maik Weinard
CPAIOR
2004
Springer
16 years 11 hour ago
Cost Evaluation of Soft Global Constraints
This paper shows that existing definitions of costs associated with soft global constraints are not sufficient to deal with all the usual global constraints. We propose more expre...
Nicolas Beldiceanu, Thierry Petit
GD
2004
Springer
16 years 3 hour ago
QUOGGLES: Query On Graphs - A Graphical Largely Extensible System
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line ...
Paul Holleis, Franz-Josef Brandenburg
KR
2004
Springer
15 years 12 months ago
Optimization Techniques for Retrieving Resources Described in OWL/RDF Documents: First Results
Practical description logic systems play an ever-growing role for knowledge representation and reasoning research even in distributed environments. In particular, the often-discus...
Volker Haarslev, Ralf Möller