Sciweavers

8196 search results - page 1439 / 1640
» Computational Modeling and Complexity Science
Sort
View
HPCA
2006
IEEE
16 years 4 months ago
Completely verifying memory consistency of test program executions
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
Chaiyasit Manovit, Sudheendra Hangal
162
Voted
W2GIS
2004
Springer
15 years 9 months ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou
DAC
2003
ACM
15 years 9 months ago
Instruction set compiled simulation: a technique for fast and flexible instruction set simulation
Instruction set simulators are critical tools for the exploration and validation of new programmable architectures. Due to increasing complexity of the architectures and timeto-ma...
Mehrdad Reshadi, Prabhat Mishra, Nikil D. Dutt
HICSS
2002
IEEE
148views Biometrics» more  HICSS 2002»
15 years 9 months ago
Barriers to a Wide-Area Trusted Network Early Warning System for Electric Power Disturbances
It is apparent that perturbations of the North American electric power grid follow the patterns and characteristics of Self Organized Critical (SOC) systems. Published studies sho...
Paul W. Oman, Jeff Roberts
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
15 years 8 months ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
« Prev « First page 1439 / 1640 Last » Next »