Sciweavers

1757 search results - page 202 / 352
» Alternating Refinement Relations
Sort
View
157
Voted
KR
2004
Springer
15 years 9 months ago
Updating of a Possibilistic Knowledge Base by Crisp or Fuzzy Transition Rules
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
Boris Mailhé, Henri Prade
140
Voted
AMKM
2003
Springer
15 years 9 months ago
A Spreading Activation Framework for Ontology-Enhanced Adaptive Information Access within Organisations
This research investigates a unique Indexing Structure and Navigational Interface which integrates (1) ontology-driven knowledge-base (2) statistically derived indexing parameters...
Md Maruf Hasan
125
Voted
KBSE
2002
IEEE
15 years 8 months ago
Process Support for Tools Interoperability
Commercial tools are heavily used, relatively cheap, well maintained, and provide powerful functionalities. However, composing these tools in order to build larger applications ra...
Anh-Tuyet Le
114
Voted
ICSE
2001
IEEE-ACM
15 years 8 months ago
Functional Paleontology: System Evolution as the User Sees It
It has long been accepted that requirements analysis should precede architectural design and implementation, but in software evolution and reverse engineering this concern with bl...
Annie I. Antón, Colin Potts
137
Voted
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
15 years 8 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla