Sciweavers

28888 search results - page 349 / 5778
» Computability and complexity in analysis
Sort
View
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 10 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
TPDS
1998
112views more  TPDS 1998»
15 years 6 months ago
Parallel Computation in Biological Sequence Analysis
—A massive volume of biological sequence data is available in over 36 different databases worldwide, including the sequence data generated by the Human Genome project. These data...
Tieng K. Yap, Ophir Frieder, Robert L. Martino
ICCAD
1992
IEEE
153views Hardware» more  ICCAD 1992»
15 years 10 months ago
Efficient techniques for inductance extraction of complex 3-D geometries
In this paper we describe combining a mesh analysis equation formulation technique with a preconditioned GORES matrix solution algorithm to accelerate the determination of inducta...
Mattan Kamon, Michael J. Tsuk, C. Smithhisler, Jac...
IPPS
1999
IEEE
15 years 11 months ago
Average-Case Analysis of Isospeed Scalability of Parallel Computations on Multiprocessors
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...
Keqin Li, Xian-He Sun
TAPIA
2005
ACM
16 years 9 days ago
Preliminary analysis of factors affecting women and african americans in the computing sciences
The current paper presents research that investigates those factors that affect the recruitment and retention of women and African Americans in the computing sciences. We begin by...
Jamika D. Burge, Tiki L. Suarez