Sciweavers

5630 search results - page 167 / 1126
» Computability in Specification
Sort
View
RANDOM
1998
Springer
15 years 8 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
EXPCS
2007
15 years 8 months ago
The user in experimental computer systems research
Experimental computer systems research typically ignores the end-user, modeling him, if at all, in overly simple ways. We argue that this (1) results in inadequate performance eva...
Peter A. Dinda, Gokhan Memik, Robert P. Dick, Bin ...
BIRTHDAY
2010
Springer
15 years 5 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
SIGCSE
2008
ACM
111views Education» more  SIGCSE 2008»
15 years 4 months ago
Improving computer science diversity through summer camps
Summer camps offer a ripe opportunity for increasing computer science diversity. This panel provides several examples of summer camps that specifically recruit from traditionally ...
Dennis P. Groth, Helen H. Hu, Betty Lauer, Hwajung...
SOCO
2010
Springer
14 years 11 months ago
Taximeter verification with GPS and soft computing techniques
Until recently, local governments in Spain were using machines with rolling cylinders for verifying taximeters. However, the condition of the tires can lead to errors in the proces...
José Villar, Adolfo Otero, José Oter...