Sciweavers

39 search results - page 7 / 8
» Formalising Generalised Substitutions
Sort
View
INFOCOM
2005
IEEE
13 years 12 months ago
New insights from a fixed point analysis of single cell IEEE 802.11 WLANs
— We study a fixed point formalisation of the well known analysis of Bianchi [3]. We provide a significant simplification and generalisation of the analysis. In this more gene...
Anurag Kumar, Eitan Altman, Daniele Miorandi, Muni...
AMAST
2000
Springer
13 years 10 months ago
Distance Functions for Defaults in Reactive Systems
Default reasoning has become an important topic in software engineering. In particular, defaults can be used to revise speci cations, to enhance reusability of existing systems, an...
Sofia Guerra
CSFW
1999
IEEE
13 years 10 months ago
Process Algebra and Non-Interference
The information security community has long debated the exact definition of the term `security'. Even if we focus on the more modest notion of confidentiality the precise def...
Peter Y. A. Ryan, Steve A. Schneider
ENTCS
2008
64views more  ENTCS 2008»
13 years 6 months ago
General Refinement, Part Two: Flexible Refinement
In the previous, companion, paper [13] to this paper we introduced our general model of refinement, discussed ideas around determinism and interfaces that the general definition r...
Steve Reeves, David Streader

Publication
240views
12 years 4 months ago
Bayesian multitask inverse reinforcement learning
We generalise the problem of inverse reinforcement learning to multiple tasks, from multiple demonstrations. Each one may represent one expert trying to solve a different task, or ...
Christos Dimitrakakis, Constantin A. Rothkopf