Sciweavers

1042 search results - page 24 / 209
» Failing First: An Update
Sort
View
SYNTHESE
2011
86views more  SYNTHESE 2011»
14 years 5 months ago
Objective Bayesianism, Bayesian conditionalisation and voluntarism
Objective Bayesianism has been criticised on the grounds that objective Bayesian updating, which on a finite outcome space appeals to the maximum entropy principle, differs from...
Jon Williamson
PDIS
1993
IEEE
15 years 2 months ago
Log-Based Directory Resolution in the Coda File System
semantic knowledge all concurrent partitionedAbstract updates to an object must be treated as conflicting, andOptimistic replication is an important technique for merged manually b...
Puneet Kumar, Mahadev Satyanarayanan
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 2 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
CIE
2007
Springer
15 years 2 months ago
A Weakly 2-Random Set That Is Not Generalized Low
A guiding question in the study of weak 2-randomness is whether weak 2-randomness is closer to 1-randomness, or closer to 2randomness. Recent research indicates that the first alte...
Andrew Lewis, Antonio Montalbán, Andr&eacut...
WMCSA
1999
IEEE
15 years 2 months ago
Broadcast of Consistent Data to Read-Only Transactions from Mobile Clients
In this paper, we study the inconsistency problem in data broadcast. While data items in a mobile computing system are being broadcast, update transactions may install new values ...
Kam-yiu Lam, Mei-Wau Au, Edward Chan