Sciweavers

577 search results - page 46 / 116
» New interval methods for constrained global optimization
Sort
View
DAM
2007
94views more  DAM 2007»
15 years 3 months ago
New formulations for the Kissing Number Problem
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem ...
Sergei Kucherenko, Pietro Belotti, Leo Liberti, Ne...
AAAI
2008
15 years 6 months ago
Efficient Optimization of Information-Theoretic Exploration in SLAM
We present a novel method for information-theoretic exploration, leveraging recent work on mapping and localization. We describe exploration as the constrained optimization proble...
Thomas Kollar, Nicholas Roy
EVOW
2006
Springer
15 years 7 months ago
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning
An original approach, termed Divide-and-Evolve is proposed to hybridize Evolutionary Algorithms (EAs) with Operational Research (OR) methods in the domain of Temporal Planning Prob...
Marc Schoenauer, Pierre Savéant, Vincent Vi...
SIAMJO
2008
212views more  SIAMJO 2008»
15 years 3 months ago
Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...
Radek Kucera
MICCAI
2009
Springer
16 years 5 months ago
Optimal Transseptal Puncture Location for Robot-Assisted Left Atrial Catheter Ablation
The preferred method of treatment for Atrial Fibrillation (AF) is by catheter ablation wherein a catheter is guided into the left atrium through a transseptal puncture. However, th...
Jagadeesan Jayender, Rajni V. Patel, Gregory F. ...