Sciweavers

5128 search results - page 242 / 1026
» When Abstraction Fails
Sort
View
IWPC
1999
IEEE
15 years 11 months ago
The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations
Automatic program comprehension is particularly useful when applied to sparse matrix codes, since it allows to abstract e.g. from specific sparse matrix storage formats used in th...
Christoph W. Keßler, Craig Smith
SSPR
1998
Springer
15 years 11 months ago
Network-Based Recognition of Architectural Symbols
Abstract. In this paper, we propose a method for recognizing architectural symbols. The method is based on the description of the model through a set of constraints on geometrical ...
Christian Ah-Soon, Karl Tombre
DAC
1996
ACM
15 years 11 months ago
A Fast State Reduction Algorithm for Incompletely Specified Finite State Machines
Abstract-- This paper proposes a state reduction algorithm for incompletely specified FSMs. The algorithm is based on iterative improvements. When the number of compatibles is like...
Hiroyuki Higuchi, Yusuke Matsunaga
138
Voted
CAISE
2006
Springer
15 years 11 months ago
Mediation Patterns for Message Exchange Protocols
Abstract. Systems interact with their environment (e.g., other systems) by exchanging messages in a particular order. Interoperability problems arise when systems do not understand...
Stanislav Pokraev, Manfred Reichert
AAIM
2010
Springer
155views Algorithms» more  AAIM 2010»
15 years 10 months ago
The (K, k)-Capacitated Spanning Tree Problem
Abstract. This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that t...
Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin