Sciweavers

4007 search results - page 148 / 802
» Computation with imprecise probabilities
Sort
View
109
Voted
LICS
2009
IEEE
15 years 10 months ago
Winning Concurrent Reachability Games Requires Doubly-Exponential Patience
—We exhibit a deterministic concurrent reachability game PURGATORYn with n non-terminal positions and a binary choice for both players in every position so that any positional st...
Kristoffer Arnsfelt Hansen, Michal Koucký, ...
GLOBECOM
2008
IEEE
15 years 10 months ago
Outage-Based Rate Maximization in CDMA Wireless Networks
—The problem of maximizing the sum of the transmit rates while limiting the outage probability below an appropriate threshold is investigated for networks where the nodes have li...
M. D'Angelo, Carlo Fischione, Matteo Butussi, Ales...
123
Voted
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
15 years 7 months ago
Finding Mobile Data: Efficiency vs. Location Inaccuracy
A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D n...
Amotz Bar-Noy, Joanna Klukowska
118
Voted
DEXA
2010
Springer
180views Database» more  DEXA 2010»
15 years 4 months ago
Identifying Interesting Instances for Probabilistic Skylines
Significant research efforts have recently been dedicated to modeling and querying uncertain data. In this paper, we focus on skyline analysis of uncertain data, modeled as uncert...
Yinian Qi, Mikhail J. Atallah
COMBINATORICS
2006
162views more  COMBINATORICS 2006»
15 years 3 months ago
Bounding the Partition Function of Spin-Systems
With a graph G = (V, E) we associate a collection of non-negative real weights vV {i,v : 1 i m} uvE{ij,uv : 1 i j m}. We consider the probability distribution on {f : V {1,...
David J. Galvin