Sciweavers

1434 search results - page 132 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
SPAA
2009
ACM
14 years 10 months ago
Brief announcement: selfishness in transactional memory
In order to be efficient with selfish programmers, a multicore transactional memory (TM) system must be designed such that it is compatible with good programming incentives (GPI),...
Raphael Eidenbenz, Roger Wattenhofer
GRID
2004
Springer
14 years 3 months ago
A Stochastic Control Model for Deployment of Dynamic Grid Services
We introduce a formal model for deployment and hosting of a dynamic grid service wherein the service provider must pay a resource provider for the use of computational resources. ...
Darin England, Jon B. Weissman
FOCS
2003
IEEE
14 years 3 months ago
On Worst-Case to Average-Case Reductions for NP Problems
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is contained in NP/poly and the polynomial hierarchy co...
Andrej Bogdanov, Luca Trevisan
CONCUR
2000
Springer
14 years 2 months ago
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
13 years 10 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj