Sciweavers

727 search results - page 20 / 146
» A Calculus of Bounded Capacities
Sort
View
MFCS
2005
Springer
14 years 1 months ago
The Complexity of Model Checking Higher Order Fixpoint Logic
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
Martin Lange, Rafal Somla
WSC
1998
13 years 9 months ago
Estimates of Multicarrier CDMA System Capacity
As CDMA systems reach capacity, infrastructure providers are extending them by offering multicarrier capability. The capacity of an n-carrier CDMA system should be at least n time...
Tony Dean, Phil Fleming, Alexander L. Stolyar
CONCUR
2003
Springer
14 years 23 days ago
Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus
We describe a probabilistic polynomial-time process calculus for analyzing cryptographic protocols and use it to derive compositionality properties of protocols in the presence of ...
Paulo Mateus, John C. Mitchell, Andre Scedrov
SAT
2010
Springer
178views Hardware» more  SAT 2010»
13 years 11 months ago
Proof Complexity of Propositional Default Logic
Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and s...
Olaf Beyersdorff, Arne Meier, Sebastian Mülle...
CORR
2007
Springer
164views Education» more  CORR 2007»
13 years 7 months ago
Capacity Region of the Finite-State Multiple Access Channel with and without Feedback
—The capacity region of the finite-state multiple-access channel (FS-MAC) with feedback that may be an arbitrary timeinvariant function of the channel output samples is consider...
Haim H. Permuter, Tsachy Weissman