Sciweavers

12289 search results - page 100 / 2458
» computing 2006
Sort
View
MST
2007
79views more  MST 2007»
15 years 2 months ago
Toward Maximizing the Quality of Results of Dependent Tasks Computed Unreliably
This paper studies the problem of maximizing the number of correct results of dependent tasks computed unreliably. We consider a distributed system composed of a reliable server th...
Li Gao, Grzegorz Malewicz
JSYML
2006
64views more  JSYML 2006»
15 years 3 months ago
Every 1-generic computes a properly 1-generic
Abstract. A real is called properly n-generic if it is n-generic but not n + 1generic. We show that every 1-generic real computes a properly 1-generic real. On the other hand, if m...
Barbara F. Csima, Rod Downey, Noam Greenberg, Deni...
JAPLL
2006
79views more  JAPLL 2006»
15 years 3 months ago
Innovations in computational type theory using Nuprl
For twenty years the Nuprl ("new pearl") system has been used to develop software systems and formal theories of computational mathematics. It has also been used to expl...
Stuart F. Allen, Mark Bickford, Robert L. Constabl...
ORDER
2007
79views more  ORDER 2007»
15 years 2 months ago
Computable Linearizations of Well-partial-orderings
Abstract. We analyze results on well-partial-orderings from the viewpoint of computability theory, and we answer a question posed by Diana Schmidt. We obtain the following results....
Antonio Montalbán
PC
2000
95views Management» more  PC 2000»
15 years 2 months ago
Massively parallel computing using commodity components
The Computational Plant (Cplant) project at Sandia National Laboratories is developing a large-scale, massively parallel computing resource from a cluster of commodity computing a...
Ron Brightwell, Lee Ann Fisk, David S. Greenberg, ...