Sciweavers

5580 search results - page 791 / 1116
» Randomized priority algorithms
Sort
View
116
Voted
TIT
2002
102views more  TIT 2002»
15 years 3 months ago
Asymptotic efficiency of two-stage disjunctive testing
Abstract--We adapt methods originally developed in information and coding theory to solve some testing problems. The efficiency of two-stage pool testing of items is characterized ...
Toby Berger, Vladimir I. Levenshtein
134
Voted
TPDS
2002
136views more  TPDS 2002»
15 years 3 months ago
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
Fabrice Rastello, Yves Robert
128
Voted
VLDB
2002
ACM
108views Database» more  VLDB 2002»
15 years 3 months ago
Adaptive Index Structures
Traditional indexes aim at optimizing the node accesses during query processing, which, however, does not necessarily minimize the total cost due to the possibly large number of r...
Yufei Tao, Dimitris Papadias
119
Voted
AUTOMATICA
2010
98views more  AUTOMATICA 2010»
15 years 3 months ago
Explicit use of probabilistic distributions in linear predictive control
: The guarantee of feasibility given feasibility at initial time is an issue that has been overlooked by many of the recent papers on stochastic model predictive control. Effective...
Basil Kouvaritakis, Mark Cannon, Sasa V. Rakovic, ...
137
Voted
MP
2007
95views more  MP 2007»
15 years 3 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking