Sciweavers

149 search results - page 17 / 30
» Solving large scale combinatorial optimization using PMA-SLS
Sort
View
ICRA
2009
IEEE
141views Robotics» more  ICRA 2009»
15 years 6 months ago
Detecting repeated motion patterns via Dynamic Programming using motion density
— In this paper, we propose a method that detects repeated motion patterns in a long motion sequence efficiently. Repeated motion patterns are the structured information that ca...
Koichi Ogawara, Yasufumi Tanabe, Ryo Kurazume, Tsu...
PRIB
2009
Springer
209views Bioinformatics» more  PRIB 2009»
15 years 6 months ago
Class Prediction from Disparate Biological Data Sources Using an Iterative Multi-Kernel Algorithm
For many biomedical modelling tasks a number of different types of data may influence predictions made by the model. An established approach to pursuing supervised learning with ...
Yiming Ying, Colin Campbell, Theodoros Damoulas, M...
SIAMSC
2010
198views more  SIAMSC 2010»
14 years 10 months ago
Analysis of Block Parareal Preconditioners for Parabolic Optimal Control Problems
In this paper, we describe block matrix algorithms for the iterative solution of large scale linear-quadratic optimal control problems arising from the optimal control of parabolic...
Tarek P. Mathew, Marcus Sarkis, Christian E. Schae...
NCA
2008
IEEE
14 years 11 months ago
Neurodynamic programming: a case study of the traveling salesman problem
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
Jia Ma, Tao Yang, Zeng-Guang Hou, Min Tan, Derong ...
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 5 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál