Sciweavers

382 search results - page 52 / 77
» Proof Theory for Distributed Knowledge
Sort
View
ATAL
2006
Springer
14 years 7 days ago
Complexity and succinctness of public announcement logic
There is a recent trend of extending epistemic logic (EL) with dynamic operators that allow to express the evolution of knowledge and induced by knowledge-changing actions. The mo...
Carsten Lutz
CORR
2008
Springer
151views Education» more  CORR 2008»
13 years 8 months ago
Identifying 'Hidden' Communities of Practice within Electronic Networks: Some Preliminary Premises
This paper examines the possibility of discovering 'hidden' (potential) Communities of Practice (CoPs) inside electronic networks, and then using this knowledge to nurtu...
Richard Ribeiro, Chris Kimble
POPL
2009
ACM
14 years 9 months ago
Compositional shape analysis by means of bi-abduction
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
Cristiano Calcagno, Dino Distefano, Peter W. O'Hea...
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 2 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
SPAA
2005
ACM
14 years 2 months ago
Randomization does not reduce the average delay in parallel packet switches
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
Hagit Attiya, David Hay