Sciweavers

14548 search results - page 90 / 2910
» The Optimal Path-Matching Problem
Sort
View
HPCC
2009
Springer
13 years 7 months ago
Reliability Optimization of Reconfigurable Computing-Based Fault-Tolerant System
Domain-partition (DP) model is a general model for reliability maximization problem under given redundancy. In this paper, an improved DP model is used to formulate a reconfigurati...
Mi Zhou, Lihong Shang, Yu Hu
SAC
2011
ACM
13 years 5 months ago
A quasi-Newton acceleration for high-dimensional optimization algorithms
Abstract In many statistical problems, maximum likelihood estimation by an EM or MM algorithm suffers from excruciatingly slow convergence. This tendency limits the application of ...
Hua Zhou, David Alexander, Kenneth Lange
CEC
2009
IEEE
14 years 4 months ago
The Differential Ant-Stigmergy Algorithm applied to dynamic optimization problems
— Many real-world problems are dynamic, requiring an optimization algorithm which is able to continuously track a changing optimum over time. In this paper, we present a stigmerg...
Peter Korosec, Jurij Silc
ESA
2010
Springer
227views Algorithms» more  ESA 2010»
13 years 11 months ago
Approximating Parameterized Convex Optimization Problems
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
Joachim Giesen, Martin Jaggi, Sören Laue
CP
2009
Springer
14 years 4 months ago
Exploiting Problem Decomposition in Multi-objective Constraint Optimization
Multi-objective optimization is concerned with problems involving multiple measures of performance which should be optimized simultaneously. In this paper, we extend AND/OR Branch-...
Radu Marinescu