10 search results - page 1 / 2 » Reusable Ada Libraries Supporting Infinite Data Structures |
139
Voted
SIGADA
1998
Springer
15 years 11 months ago
1998
Springer
197
Voted
ADAEUROPE
2003
Springer
16 years 6 days ago
2003
Springer
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
190
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Reusable software components need well-defined interfaces, rigorously and completely documented features, and a design amenable both to reuse and to formal verification; all these...
190
click to vote
IPPS
2006
IEEE
16 years 1 months ago
2006
IEEE
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
197
Voted
ICSE
2008
IEEE-ACM
16 years 7 months ago
2008
IEEE-ACM
Understanding the structure of large existing (and evolving) software systems is a major challenge for software engineers. In reverse engineering, we aim to compute, for a given s...