Sciweavers

805 search results - page 121 / 161
» Combinatorial optimization problems in self-assembly
Sort
View
GECCO
2010
Springer
162views Optimization» more  GECCO 2010»
15 years 2 months ago
Heuristics for sampling repetitions in noisy landscapes with fitness caching
For many large-scale combinatorial search/optimization problems, meta-heuristic algorithms face noisy objective functions, coupled with computationally expensive evaluation times....
Forrest Stonedahl, Susa H. Stonedahl
IDA
2009
Springer
15 years 4 months ago
Canonical Dual Approach to Binary Factor Analysis
Abstract. Binary Factor Analysis (BFA) is a typical problem of Independent Component Analysis (ICA) where the signal sources are binary. Parameter learning and model selection in B...
Ke Sun, Shikui Tu, David Yang Gao, Lei Xu
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
14 years 11 months ago
A hybrid method for tuning neural network for time series forecasting
This paper presents an study about a new Hybrid method GRASPES - for time series prediction, inspired in F. Takens theorem and based on a multi-start metaheuristic for combinatori...
Aranildo Rodrigues Lima Junior, Tiago Alessandro E...
CVIU
2010
138views more  CVIU 2010»
14 years 10 months ago
Probabilistic structure matching for visual SLAM with a multi-camera rig
We propose to use a multi-camera rig for simultaneous localization and mapping (SLAM), providing flexibility in sensor placement on mobile robot platforms while exploiting the str...
Michael Kaess, Frank Dellaert
PAMI
2007
176views more  PAMI 2007»
14 years 9 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas