Sciweavers

2721 search results - page 170 / 545
» An experimental analysis of Lemke-Howson algorithm
Sort
View
IWMM
2009
Springer
164views Hardware» more  IWMM 2009»
15 years 4 months ago
Live heap space analysis for languages with garbage collection
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
SPIN
2009
Springer
15 years 4 months ago
Subsumer-First: Steering Symbolic Reachability Analysis
Abstract. Symbolic reachability analysis provides a basis for the verification of software systems by offering algorithmic support for the exploration of the program state space ...
Andrey Rybalchenko, Rishabh Singh
CODES
2007
IEEE
15 years 4 months ago
Performance modeling for early analysis of multi-core systems
Performance analysis of microprocessors is a critical step in defining the microarchitecture, prior to register-transfer-level (RTL) design. In complex chip multiprocessor systems...
Reinaldo A. Bergamaschi, Indira Nair, Gero Dittman...
BMCBI
2006
100views more  BMCBI 2006»
14 years 10 months ago
Empirical array quality weights in the analysis of microarray data
Background: Assessment of array quality is an essential step in the analysis of data from microarray experiments. Once detected, less reliable arrays are typically excluded or &qu...
Matthew E. Ritchie, Dileepa S. Diyagama, Jody Neil...
ICPP
2006
IEEE
15 years 4 months ago
A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
Srikanta Tirthapura, Sudip Seal, Srinivas Aluru