Sciweavers

9532 search results - page 1763 / 1907
» Logic, Graphs, and Algorithms
Sort
View
EUROPAR
1998
Springer
15 years 3 months ago
Parallel Sparse Matrix Computations Using the PINEAPL Library: A Performance Study
Abstract. The Numerical Algorithms Group Ltd is currently participating in the European HPCN Fourth Framework project on Parallel Industrial NumErical Applications and Portable Lib...
Arnold R. Krommer
LATIN
1998
Springer
15 years 3 months ago
Short and Smooth Polygonal Paths
Abstract. Automatic graph drawers need to compute paths among vertices of a simple polygon which besides remaining in the interior need to exhibit certain aesthetic properties. Som...
James Abello, Emden R. Gansner
MICRO
1997
IEEE
141views Hardware» more  MICRO 1997»
15 years 3 months ago
Unroll-and-Jam Using Uniformly Generated Sets
Modern architectural trends in instruction-level parallelism (ILP) are to increase the computational power of microprocessors significantly. As a result, the demands on memory ha...
Steve Carr, Yiping Guan
SIGCSE
1997
ACM
121views Education» more  SIGCSE 1997»
15 years 3 months ago
Application-based modules using apprentice learning for CS 2
A typical Data Structures (CS 2) course covers a wide variety of topics: elementary algorithm analysis; data structures including dynamic structures, trees, tables, graphs, etc.; ...
Owen L. Astrachan, Robert F. Smith, James T. Wilke...
CONCUR
1997
Springer
15 years 3 months ago
Modularity for Timed and Hybrid Systems
Abstract. In a trace-based world, the modular speci cation, veri cation, and control of live systems require each module to be receptive that is, each module must be able to meet i...
Rajeev Alur, Thomas A. Henzinger
« Prev « First page 1763 / 1907 Last » Next »