Sciweavers

4622 search results - page 122 / 925
» Foundations of Information Theory
Sort
View
FLAIRS
2008
15 years 11 days ago
Causal Reasoning with Contexts Using Dependent Types
In Artificial Intelligence, a crucial requirement is the ability to reason about actions and their effects on the environment. Traditional approaches which rely on classical logic...
Richard Dapoigny, Patrick Barlatier
WOA
2000
14 years 11 months ago
Calculi for Network Aware Programming
ogramming are evaluated along three different guidelines: the programming abstractions the calculus suggests; the underlying programming model; the security mechanisms provided. Th...
Gian Luigi Ferrari, Rosario Pugliese, Emilio Tuost...
JSAC
2006
180views more  JSAC 2006»
14 years 10 months ago
A Tutorial on Decomposition Methods for Network Utility Maximization
A systematic understanding of the decomposability structures in network utility maximization is key to both resource allocation and functionality allocation. It helps us obtain the...
Daniel Pérez Palomar, Mung Chiang
JSYML
2007
62views more  JSYML 2007»
14 years 10 months ago
A reduction of the NF consistency problem
We give a necessary and sufficient condition in order that a typeshifting automorphism be constructed on a model of the Theory of Simple Types (TST) by forcing. Namely it is prove...
Athanassios Tzouvaras
JSYML
2007
79views more  JSYML 2007»
14 years 10 months ago
Models of non-well-founded sets via an indexed final coalgebra theorem
The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of ...
Federico De Marchi, Benno van den Berg