Sciweavers

9210 search results - page 1565 / 1842
» Analyzing Real-Time Systems
Sort
View
89
Voted
SPAA
1998
ACM
15 years 5 months ago
Fast Set Operations Using Treaps
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
Guy E. Blelloch, Margaret Reid-Miller
WOSP
1998
ACM
15 years 5 months ago
Predicting memory use from a class diagram using dynamic information
Increasingly, new applications are being built by composing existing software components rather than by coding a system from scratch. Using this approach, applications can be buil...
Gail C. Murphy, Ekaterina Saenko
GD
1998
Springer
15 years 5 months ago
Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....
ASAP
1997
IEEE
156views Hardware» more  ASAP 1997»
15 years 5 months ago
Design methodology for digital signal processing
Improvements in semiconductor integration density and the resulting problem of having to manage designs of increasing complexity is an old one, but still current. The new challeng...
Gerhard Fettweis
ICSE
1998
IEEE-ACM
15 years 5 months ago
Parallel Changes in Large Scale Software Development: An Observational Case Study
An essential characteristic of large scale software development is parallel development by teams of developers. How this parallel development is structured and supported has a pro...
Dewayne E. Perry, Harvey P. Siy, Lawrence G. Votta
« Prev « First page 1565 / 1842 Last » Next »