Sciweavers

3049 search results - page 119 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
AAAI
2006
15 years 6 months ago
Memory Intensive Branch-and-Bound Search for Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sens...
Radu Marinescu 0002, Rina Dechter
ICML
2006
IEEE
16 years 5 months ago
Generalized spectral bounds for sparse LDA
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
Baback Moghaddam, Yair Weiss, Shai Avidan
127
Voted
ERSHOV
2003
Springer
15 years 9 months ago
Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
Henrik Björklund, Sven Sandberg, Sergei G. Vo...
ISCAS
2005
IEEE
114views Hardware» more  ISCAS 2005»
15 years 10 months ago
Structured stochastic optimization strategies for problems with ill-conditioned error surfaces
—This paper compares the performance of several structured optimization strategies in adaptive signal processing problems that are characterized by ill-conditioned error surfaces...
S. Pal, Dean J. Krusienski, W. Kenneth Jenkins
GECCO
2003
Springer
120views Optimization» more  GECCO 2003»
15 years 9 months ago
A Similarity-Based Mating Scheme for Evolutionary Multiobjective Optimization
This paper proposes a new mating scheme for evolutionary multiobjective optimization (EMO), which simultaneously improves the convergence speed to the Pareto-front and the diversit...
Hisao Ishibuchi, Youhei Shibata