Sciweavers

5331 search results - page 57 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
AIPS
1994
14 years 11 months ago
A Planner with Quality Goal and Its Speed-up Learning for Optimization Problem
Aimsof traditional planners had beenlimited to finding a sequenceof operators rather than finding an optimal or neax-optimalfinal state. Consequent]y, the performanceimprovementsy...
Masahiko Iwamoto

Publication
2630views
16 years 9 months ago
DIJKSTRA’S and Fast Marching Method for Optimal Path Planning
This technical report illustrates the differences in solving the optimal path problem (shortest path) using different methods, where the underlying PDE can be described by the eik...
RYO TAKEI
GECCO
2007
Springer
161views Optimization» more  GECCO 2007»
15 years 3 months ago
Alternative techniques to solve hard multi-objective optimization problems
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
Ricardo Landa Becerra, Carlos A. Coello Coello, Al...
SIAMSC
2010
198views more  SIAMSC 2010»
14 years 8 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...
EOR
2008
78views more  EOR 2008»
14 years 9 months ago
Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...
Haye Lau, Shoudong Huang, Gamini Dissanayake