Sciweavers

11016 search results - page 1930 / 2204
» Cloud Computing for Science
Sort
View
ICALP
2003
Springer
15 years 12 months ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
ICFEM
2003
Springer
15 years 12 months ago
Formal Proof of a Polychronous Protocol for Loosely Time-Triggered Architectures
The verification of safety critical systems has become an area of increasing importance in computer science. The notion of reactive system has emerged to concentrate on problems r...
Mickaël Kerboeuf, David Nowak, Jean-Pierre Ta...
ICTCS
2003
Springer
15 years 12 months ago
Cost Constrained Fixed Job Scheduling
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
Qiwei Huang, Errol L. Lloyd
HT
2010
ACM
15 years 11 months ago
Discovery of information disseminators and receptors on online social media
Today, there is significant sharing of information artifacts among users on various social media sites, including Digg, Twitter and Flickr. An interesting consequence of such ric...
Munmun De Choudhury
ICSM
2002
IEEE
15 years 11 months ago
Two Controlled Experiments Concerning the Usefulness of Assertions as a Means for Programming
Assertions, or more generally “Programming by contract”, have gained widespread acceptance in the computer science community as a means for correct program development. Howeve...
Matthias M. Müller, Rainer Typke, Oliver Hagn...
« Prev « First page 1930 / 2204 Last » Next »