Sciweavers

14649 search results - page 309 / 2930
» Principles of problem solving
Sort
View
SIAMJO
2011
15 years 1 months ago
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
Min Tao, Xiaoming Yuan
SIAMSC
2010
108views more  SIAMSC 2010»
15 years 5 months ago
Goal-Oriented Error Estimation and Adaptivity for Free-Boundary Problems: The Shape-Linearization Approach
Abstract. We develop duality-based a posteriori error estimates for functional outputs of solutions of free-boundary problems via shape-linearization principles. To derive an appro...
K. G. van der Zee, E. H. van Brummelen, R. de Bors...
ANOR
2010
123views more  ANOR 2010»
15 years 6 months ago
Nature inspired genetic algorithms for hard packing problems
This paper presents two novel genetic algorithms (GAs) for hard industrially relevant packing problems. The design of both algorithms is inspired by aspects of molecular genetics,...
Philipp Rohlfshagen, John A. Bullinaria
239
Voted
GECCO
2011
Springer
270views Optimization» more  GECCO 2011»
14 years 10 months ago
Geometric surrogate-based optimisation for permutation-based problems
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon
ISVC
2009
Springer
16 years 1 months ago
Combinatorial Preconditioners and Multilevel Solvers for Problems in Computer Vision and Image Processing
Abstract. Linear systems and eigen-calculations on symmetric diagonally dominant matrices (SDDs) occur ubiquitously in computer vision, computer graphics, and machine learning. In ...
Ioannis Koutis, Gary L. Miller, David Tolliver