Sciweavers

688 search results - page 28 / 138
» Comparison of Conceptual Graphs
Sort
View
ALENEX
2004
121views Algorithms» more  ALENEX 2004»
14 years 11 months ago
Experimental Comparison of Shortest Path Approaches for Timetable Information
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the time-expanded approach every event...
Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Ch...
IPPS
1994
IEEE
15 years 1 months ago
A Comparison of Heuristics for Scheduling DAGs on Multiprocessors
Many algorithms to schedule DAGs on multiprocessors have been proposed, but there has been little work done to determine their effectiveness. Since multi-processor scheduling is a...
Carolyn McCreary, A. A. Khan, J. J. Thompson, M. E...
SOFTVIS
2010
ACM
14 years 8 months ago
Visual comparison of software architectures
Reverse engineering methods produce different descriptions of software architectures. In this work we analyze and define the task of exploring and comparing these descriptions. ...
Fabian Beck, Stephan Diehl
IPPS
2010
IEEE
14 years 7 months ago
A general algorithm for detecting faults under the comparison diagnosis model
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
Iain A. Stewart
ICCS
2004
Springer
15 years 3 months ago
KNAML: A Knowledge Representation Language for Distributed Reasoning
The Knowledge Agent Mediation Language (KNAML) is designed for use in multi-agent reasoning systems. Like conceptual graphs, KNAML represents knowledge using concepts, relations, a...
Gordon Streeter, Andrew Potter