Sciweavers

129 search results - page 6 / 26
» Optimal solutions for moving target search
Sort
View
GECCO
2005
Springer
120views Optimization» more  GECCO 2005»
14 years 1 months ago
Exploiting gradient information in numerical multi--objective evolutionary optimization
Various multi–objective evolutionary algorithms (MOEAs) have obtained promising results on various numerical multi– objective optimization problems. The combination with gradi...
Peter A. N. Bosman, Edwin D. de Jong
GECCO
2008
Springer
108views Optimization» more  GECCO 2008»
13 years 9 months ago
Search space reduction technique for constrained optimization with tiny feasible space
The hurdles in solving Constrained Optimization Problems (COP) arise from the challenge of searching a huge variable space in order to locate feasible points with acceptable solut...
Abu S. S. M. Barkat Ullah, Ruhul A. Sarker, David ...
ICCSA
2005
Springer
14 years 1 months ago
A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement
Abstract. In this paper, we present a parallel tabu search (TS) algorithm for efficient optimization of a constrained multiobjective VLSI standard cell placement problem. The prima...
Mahmood R. Minhas, Sadiq M. Sait
ICRA
1999
IEEE
146views Robotics» more  ICRA 1999»
14 years 21 days ago
Planning Tracking Motions for an Intelligent Virtual Camera
We consider the problem of automatically generating viewpoint motions for a virtual camera tracking a moving target. Given the target's trajectory, we plan the motion of a ca...
Tsai-Yen Li, Tzong-Hann Yu
PPSN
2010
Springer
13 years 6 months ago
Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
Mario Ruthmair, Günther R. Raidl