Sciweavers

10271 search results - page 501 / 2055
» Computer Science
Sort
View
ACMSE
2006
ACM
16 years 11 days ago
Extensions to and optimization of a mobile computational system for internet programming
elow are abstracts of student-faculty collaborative work presented at regional, national, and international conferences. Gregory Adkins, Elizabeth Carter, Amanda Micai, and Sarah M...
Sarah Monisha Pulimood, Gregory Adkins, Elizabeth ...
RANDOM
1998
Springer
15 years 10 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
FOCS
1994
IEEE
15 years 10 months ago
Scheduling Multithreaded Computations by Work Stealing
This paper studies the problem of e ciently scheduling fully strict (i.e., wellstructured) multithreaded computations on parallel computers. A popular and practical method of sche...
Robert D. Blumofe
DC
2007
15 years 6 months ago
On private computation in incomplete networks
Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious...
Amos Beimel
CCA
2009
Springer
16 years 29 days ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi