Sciweavers

1702 search results - page 60 / 341
» Using Nondeterminism to Design Efficient Deterministic Algor...
Sort
View
VLSID
1997
IEEE
135views VLSI» more  VLSID 1997»
13 years 12 months ago
Parallel Genetic Algorithms for Simulation-Based Sequential Circuit Test Generation
The problem of test generation belongs to the class of NP-complete problems and it is becoming more and more di cult as the complexity of VLSI circuits increases, and as long as e...
Dilip Krishnaswamy, Michael S. Hsiao, Vikram Saxen...
MP
1998
109views more  MP 1998»
13 years 7 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
JMLR
2008
141views more  JMLR 2008»
13 years 7 months ago
A New Algorithm for Estimating the Effective Dimension-Reduction Subspace
The statistical problem of estimating the effective dimension-reduction (EDR) subspace in the multi-index regression model with deterministic design and additive noise is consider...
Arnak S. Dalalyan, Anatoly Juditsky, Vladimir Spok...
WSC
2007
13 years 10 months ago
Stochastic trust region gradient-free method (strong): a new response-surface-based algorithm in simulation optimization
Response Surface Methodology (RSM) is a metamodelbased optimization method. Its strategy is to explore small subregions of the parameter space in succession instead of attempting ...
Kuo-Hao Chang, L. Jeff Hong, Hong Wan
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
13 years 9 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova