Sciweavers

2137 search results - page 239 / 428
» Proving Abstract Non-interference
Sort
View
119
Voted
CORR
2008
Springer
90views Education» more  CORR 2008»
15 years 3 months ago
Effective Complexity and its Relation to Logical Depth
Abstract--Effective complexity measures the information content of the regularities of an object. It has been introduced by M. Gell-Mann and S. Lloyd to avoid some of the disadvant...
Nihat Ay, Markus Mueller, Arleta Szkola
134
Voted
DEDS
2010
130views more  DEDS 2010»
15 years 3 months ago
Message Batching in Wireless Sensor Networks - A Perturbation Analysis Approach
Abstract-- We address the problem of batching messages generated at nodes of a sensor network for the purpose of reducing communication energy at the expense of added latency. We f...
Xu Ning, Christos G. Cassandras
125
Voted
ACTA
2006
108views more  ACTA 2006»
15 years 3 months ago
Refinement verification of the lazy caching algorithm
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...
Wim H. Hesselink
122
Voted
AMC
2006
79views more  AMC 2006»
15 years 3 months ago
Church's thesis meets the N-body problem
``Church's thesis'' is at the foundation of computer science. We point out that with any particular set of physical laws, Church's thesis need not merely be po...
Warren D. Smith
APAL
2006
63views more  APAL 2006»
15 years 3 months ago
Satisfaction of existential theories in finitely presented groups and some embedding theorems
Abstract. The main result is that for every recursively enumerable existential consistent theory (in the usual language of group theory), there exists a finitely presented SQ-univ...
Abderezak Ould Houcine