Sciweavers

269 search results - page 27 / 54
» A branch and bound method for stochastic global optimization
Sort
View
TACAS
2010
Springer
160views Algorithms» more  TACAS 2010»
15 years 4 months ago
Optimal Tableau Algorithms for Coalgebraic Logics
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
Rajeev Goré, Clemens Kupke, Dirk Pattinson
NIPS
2007
14 years 11 months ago
Bundle Methods for Machine Learning
We present a globally convergent method for regularized risk minimization problems. Our method applies to Support Vector estimation, regression, Gaussian Processes, and any other ...
Alex J. Smola, S. V. N. Vishwanathan, Quoc V. Le

Publication
173views
13 years 8 months ago
Max-Flow Segmentation of the Left Ventricle by Recovering Subject-Specific Distributions via a Bound of the Bhattacharyya Measur
This study investigates fast detection of the left ventricle (LV) endo- and epicardium boundaries in a cardiac magnetic resonance (MR) sequence following the optimization of two or...
Ismail Ben Ayed, Hua-mei Chen, Kumaradevan Punitha...
EMO
2005
Springer
68views Optimization» more  EMO 2005»
15 years 3 months ago
Multi-objective Optimization of Problems with Epistemic Uncertainty
Abstract. Multi-objective evolutionary algorithms (MOEAs) have proven to be a powerful tool for global optimization purposes of deterministic problem functions. Yet, in many real-w...
Philipp Limbourg
IMAMS
2007
133views Mathematics» more  IMAMS 2007»
14 years 11 months ago
Tuning Subdivision Algorithms Using Constrained Energy Optimization
In this paper a method is presented to fair the limit surface of a subdivision algorithm around an extraordinary point. The eigenvalues and eigenvectors of the subdivision matrix d...
Ingo Ginkel, Georg Umlauf