Sciweavers

932 search results - page 46 / 187
» Where in the Wikipedia Is That Answer
Sort
View
LPNMR
2009
Springer
14 years 2 months ago
Applying ASP to UML Model Validation
We apply ASP to model validation in a CASE setting, where models are UML class diagrams and object diagrams are called “snapshots”. We present the design and implementation of ...
Mario Ornaghi, Camillo Fiorentini, Alberto Momigli...
ISAAC
2004
Springer
121views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Approximate Distance Oracles for Graphs with Dense Clusters
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
Mattias Andersson, Joachim Gudmundsson, Christos L...
DAM
2007
129views more  DAM 2007»
13 years 7 months ago
Easy and hard instances of arc ranking in directed graphs
: In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that de...
Dariusz Dereniowski
JELIA
2010
Springer
13 years 6 months ago
The mcs-ie System for Explaining Inconsistency in Multi-Context Systems
The Multi-Context System Inconsistency Explainer allows for evaluation of semantics and explanation of inconsistencies in systems where heterogeneous knowledge bases are linked via...
Markus Bögl, Thomas Eiter, Michael Fink, Pete...
TCS
2008
13 years 7 months ago
Election and rendezvous with incomparable labels
In "Can we elect if we cannot compare" (SPAA'03), Barri`ere, Flocchini, Fraigniaud and Santoro consider a qualitative model of distributed computing, where the label...
Jérémie Chalopin