Sciweavers

8370 search results - page 1472 / 1674
» Challenges in P2P Computing
Sort
View
ICST
2009
IEEE
16 years 25 days ago
Using JML Runtime Assertion Checking to Automate Metamorphic Testing in Applications without Test Oracles
It is challenging to test applications and functions for which the correct output for arbitrary input cannot be known in advance, e.g. some computational science or machine learni...
Christian Murphy, Kuang Shen, Gail E. Kaiser
INFOCOM
2009
IEEE
16 years 25 days ago
Time Valid One-Time Signature for Time-Critical Multicast Data Authentication
Abstract—It is challenging to provide authentication to timecritical multicast data, where low end-to-end delay is of crucial importance. Consequently, it requires not only effi...
Qiyan Wang, Himanshu Khurana, Ying Huang, Klara Na...
BICOB
2009
Springer
16 years 23 days ago
A Bayesian Approach to High-Throughput Biological Model Generation
Abstract. With the availability of hundreds and soon-to-be thousands of complete genomes, the construction of genome-scale metabolic models for these organisms has attracted much a...
Xinghua Shi, Rick L. Stevens
CIKM
2009
Springer
16 years 22 days ago
On the feasibility of multi-site web search engines
Web search engines are often implemented as centralized systems. Designing and implementing a Web search engine in a distributed environment is a challenging engineering task that...
Ricardo A. Baeza-Yates, Aristides Gionis, Flavio J...
ISAAC
2009
Springer
142views Algorithms» more  ISAAC 2009»
16 years 22 days ago
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Core...
« Prev « First page 1472 / 1674 Last » Next »