Sciweavers

5326 search results - page 1 / 1066
» On what we can ensure
Sort
View
SYNTHESE
2008
68views more  SYNTHESE 2008»
13 years 4 months ago
On what we can ensure
: The Conjunction Principle says, roughly, that if the truth of a conjunction can be brought about, then the truth of each conjunct can be brought about. The current essay argues t...
Benjamin Schnieder
EUROPAR
2005
Springer
13 years 10 months ago
Faults in Large Distributed Systems and What We Can Do About Them
Scientists are increasingly using large distributed systems built from commodity off-the-shelf components to perform scientific computation. Grid computing has expanded the scale ...
George Kola, Tevfik Kosar, Miron Livny
ENTCS
2002
78views more  ENTCS 2002»
13 years 4 months ago
What can we do with a Solution?
If S = 0 is a system of n equations and unknowns over C and S() = 0 to what extent can we compute with the point ? In particular, can we decide whether or not a polynomial express...
Simon Langley, Daniel Richardson
CCR
2010
156views more  CCR 2010»
13 years 5 months ago
Evolvable network architectures: what can we learn from biology?
There is significant research interest recently to understand the evolution of the current Internet, as well as to design clean-slate Future Internet architectures. Clearly, even ...
Constantine Dovrolis, J. Todd Streelman
TARK
2007
Springer
13 years 11 months ago
What can we achieve by arbitrary announcements?: A dynamic take on Fitch's knowability
Public announcement logic is an extension of multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of age...
Philippe Balbiani, Alexandru Baltag, Hans P. van D...