Sciweavers

3937 search results - page 168 / 788
» Questioning Ubiquitous Computing
Sort
View
135
Voted
FPLE
1995
15 years 7 months ago
Basic Proof Skills of Computer Science Students
Computer science students need mathematical proof skills. At our University, these skills are being taught as part of various mathematics and computer science courses. To test the ...
Pieter H. Hartel, Bert van Es, Dick Tromp
135
Voted
PDPTA
2010
15 years 1 months ago
Collecting Sensor Data for High-Performance Computing: A Case-study
- Many research questions remain open with regard to improving reliability in exascale systems. Among others, statistics-based analysis has been used to find anomalies, to isolate ...
Line C. Pouchard, Jonathan D. Dobson, Stephen W. P...
122
Voted
SAGT
2009
Springer
131views Game Theory» more  SAGT 2009»
15 years 10 months ago
The Computational Complexity of Weak Saddles
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...
Felix Brandt, Markus Brill, Felix A. Fischer, Jan ...
105
Voted
WDAG
2005
Springer
118views Algorithms» more  WDAG 2005»
15 years 9 months ago
Distributed Computing with Imperfect Randomness
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanatha...
106
Voted
CORR
2010
Springer
151views Education» more  CORR 2010»
15 years 2 months ago
Adding a referee to an interconnection network: What can(not) be computed in one round
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
Florent Becker, Martín Matamala, Nicolas Ni...