Sciweavers

3422 search results - page 32 / 685
» Random Subset Optimization
Sort
View
WSC
2008
15 years 4 months ago
A particle filtering framework for randomized optimization algorithms
We propose a framework for optimization problems based on particle filtering (also called Sequential Monte Carlo method). This framework unifies and provides new insight into rand...
Enlu Zhou, Michael C. Fu, Steven I. Marcus
IPCO
1996
89views Optimization» more  IPCO 1996»
15 years 3 months ago
On Dependent Randomized Rounding Algorithms
In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to several classes of discrete optimization problems. In t...
Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra
CCE
2008
15 years 2 months ago
Bidirectional branch and bound for controlled variable selection: Part I. Principles and minimum singular value criterion
The minimum singular value (MSV) rule is a useful tool for selecting controlled variables (CVs) from the available measurements. However, the application of the MSV rule to large-...
Yi Cao, Vinay Kariwala
DATE
2003
IEEE
98views Hardware» more  DATE 2003»
15 years 7 months ago
On the Characterization of Hard-to-Detect Bridging Faults
We investigate a characterization of hard-to-detect bridging faults. For circuits with large numbers of lines (or nodes), this characterization can be used to select target faults...
Irith Pomeranz, Sudhakar M. Reddy, Sandip Kundu
SODA
2004
ACM
127views Algorithms» more  SODA 2004»
15 years 3 months ago
An optimal randomized algorithm for maximum Tukey depth
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...
Timothy M. Chan