Sciweavers

3446 search results - page 181 / 690
» A Reasoning Algorithm for pD*
Sort
View
ICASSP
2010
IEEE
15 years 4 months ago
Sub-Nyquist processing with the modulated wideband converter
Sub-Nyquist systems capture the signal information in a different fashion than uniform high-rate samples. Consequently, digital processing, which is the prime reason for leaving t...
Moshe Mishali, Asaf Elron, Yonina C. Eldar
JUCS
2007
108views more  JUCS 2007»
15 years 4 months ago
Integrating Module Checking and Deduction in a Formal Proof for the Perlman Spanning Tree Protocol (STP)
: In the IEEE 802.1D standard for the Media Access Control layer (MAC layer) bridges, there is an STP (Spanning Tree Protocol) definition, based on the algorithm that was proposed...
Hossein Hojjat, Hootan Nakhost, Marjan Sirjani
CL
2004
Springer
15 years 4 months ago
Nesting analysis of mobile ambients
A new algorithm is introduced for analyzing possible nestings in mobile ambient calculus. It improves both time and space complexities of the technique proposed by Nielson and Sei...
Chiara Braghin, Agostino Cortesi, Riccardo Focardi...
CSL
2002
Springer
15 years 4 months ago
On the Automatizability of Resolution and Related Propositional Proof Systems
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
Albert Atserias, Maria Luisa Bonet
ATAL
2011
Springer
14 years 4 months ago
Towards a unifying characterization for quantifying weak coupling in dec-POMDPs
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
Stefan J. Witwicki, Edmund H. Durfee