Sciweavers

170 search results - page 18 / 34
» On the Probability of the Number of Solutions for the P4P Pr...
Sort
View
UAI
2003
13 years 10 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 8 months ago
Optimum Power and Rate Allocation for Coded V-BLAST: Average Optimization
An analytical framework for performance analysis and optimization of coded V-BLAST is developed. Average power and/or rate allocations to minimize the outage probability as well as...
Victoria Kostina, Sergey Loyka
MOBICOM
2006
ACM
14 years 2 months ago
Stochastic event capture using mobile sensors subject to a quality metric
Mobile sensors cover more area over a period of time than the same number of stationary sensors. However, the quality of coverage achieved by mobile sensors depends on the velocit...
Nabhendra Bisnik, Alhussein A. Abouzeid, Volkan Is...
IM
2003
13 years 10 months ago
Enabling PreOS Desktop Management
: Desktop management is probably the most resource-consuming task for the typical operations and support team, regardless of being frequently overlooked as not as complex or specia...
Tiago Cruz, Paulo Simões
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 8 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking