Sciweavers

295 search results - page 54 / 59
» Games and Definability for System F
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 7 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
POPL
2008
ACM
14 years 7 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...
JSAC
2006
109views more  JSAC 2006»
13 years 7 months ago
Polarized MIMO channels in 3-D: models, measurements and mutual information
4G systems are expected to support data rates of the order of 100 Mbps in the outdoor environment and 1 Gbps in the indoor/stationary environment. In order to support such large p...
Mansoor Shafi, Min Zhang, Aris L. Moustakas, Peter...
ICAIL
2003
ACM
14 years 23 days ago
Positive and Negative Expectations and the Deontic Nature of Social Conventions
The general goal of the paper is to show the normative/deontic nature of conventions. Conventions are traditionally defined as regularity of behavior based on expectations evolved...
Cristiano Castelfranchi, Luca Tummolini
C5
2004
IEEE
13 years 11 months ago
Scratch: A Sneak Preview
information technologies as "the ability to reformulate knowledge, to express oneself creatively and appropriately, and to produce and generate information (rather than simply...
John Maloney, Leo Burd, Yasmin B. Kafai, Natalie R...