Sciweavers

1510 search results - page 34 / 302
» Upper Probabilities and Additivity
Sort
View
GECCO
2004
Springer
14 years 4 months ago
On the Complexity to Approach Optimum Solutions by Inhomogeneous Markov Chains
We analyse the probability 1 − δ to be in an optimum solution after k steps of an inhomogeneous Markov chain which is specified by a logarithmic cooling schedule c(k) = Γ/ ln ...
Andreas Alexander Albrecht
DLOG
2010
13 years 9 months ago
Optimal Rewritings in Definitorially Complete Description Logics
In this paper, we revisit the problem of definitorial completeness, i.e., whether a given general TBox T in a description logic (DL) L can be rewritten to an acyclic TBox T in L . ...
Inanç Seylan, Enrico Franconi, Jos de Bruij...
TWC
2008
105views more  TWC 2008»
13 years 10 months ago
Receive Antenna Array Strategies in Fading and Interference: An Outage Probability Comparison
We explore tradeoffs between different reception strategies of multiple receive antennas in fading channels with co-channel interference (CCI). Our tradeoff analysis is based on ou...
Juan M. Romero-Jerez, Andrea J. Goldsmith
TRS
2008
13 years 10 months ago
Local and Global Approximations for Incomplete Data
Abstract. For completely specified decision tables lower and upper approximations are unique, the lower approximation is the largest definable set contained in the approximated set...
Jerzy W. Grzymala-Busse, Wojciech Rzasa
IWRT
2008
14 years 11 days ago
Tag Loss Probability Evaluation for a Continuous Flow of Tags in the EPC-Global Standard
Abstract. This paper addresses the evaluation of a passive RFID system under a continuous flow of tag arrivals and departures, for instance, in a conveyor belt installation. In suc...
Javier Vales-Alonso, M. Victoria Bueno-Delgado, Es...