Sciweavers

2056 search results - page 347 / 412
» time 2000
Sort
View
FAC
2000
94views more  FAC 2000»
13 years 9 months ago
Maximally Concurrent Programs
Typically, program design involves constructing a program P that implements a given specification S; that is, the set P of executions of P is a subset of the set S of executions s...
Rajeev Joshi, Jayadev Misra
FGCS
2000
143views more  FGCS 2000»
13 years 9 months ago
A data intensive distributed computing architecture for "Grid" applications
Modern scientific computing involves organizing, moving, visualizing, and analyzing massive amounts of data from around the world, as well as employing large-scale computation. The...
Brian Tierney, William E. Johnston, Jason Lee, Mar...
FUIN
2000
68views more  FUIN 2000»
13 years 9 months ago
Models For Dependable Computation with Multiple Inputs and Some Hardness Results
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
Yongge Wang, Yvo Desmedt, Mike Burmester
IJMMS
2000
96views more  IJMMS 2000»
13 years 9 months ago
Calculators are needlessly bad
In the two decades hand-held calculators have been readily available there has been ample time to develop a usable design and to educate the consumer public into choosing quality d...
Harold W. Thimbleby
IJPP
2000
94views more  IJPP 2000»
13 years 9 months ago
Path Analysis and Renaming for Predicated Instruction Scheduling
Increases in instruction level parallelism are needed to exploit the potential parallelism available in future wide issue architectures. Predicated execution is an architectural m...
Lori Carter, Beth Simon, Brad Calder, Larry Carter...