Sciweavers

20294 search results - page 228 / 4059
» Algorithmic Information Theory
Sort
View
CSCLP
2008
Springer
15 years 7 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
DCC
2006
IEEE
16 years 5 months ago
Analysis of Multiple Antenna Systems with Finite-Rate Feedback Using High Resolution Quantization Theory
This paper considers the development of a general framework for the analysis of transmit beamforming methods in multiple antenna systems with finite-rate feedback. Inspired by the...
Jun Zheng, Ethan R. Duni, Bhaskar D. Rao
FOSSACS
2010
Springer
16 years 26 days ago
Retaining the Probabilities in Probabilistic Testing Theory
Abstract. This paper considers the probabilistic may/must testing theory for processes having external, internal, and probabilistic choices. We observe that the underlying testing ...
Sonja Georgievska, Suzana Andova
CONCUR
2005
Springer
15 years 11 months ago
Selecting Theories and Recursive Protocols
Many decidability results are known for non-recursive cryptographic protocols, where the protocol steps can be expressed by simple rewriting rules. Recently, a tree transducer-base...
Tomasz Truderung
KR
2010
Springer
15 years 10 months ago
Preferential Semantics for Plausible Subsumption in Possibility Theory
Handling exceptions in a knowledge-based system has been considered as an important issue in many domains of applications, such as medical domain. In this paper, we propose severa...
Guilin Qi, Zhizheng Zhang