Sciweavers

413 search results - page 28 / 83
» On Solving Geometric Optimization Problems Using Shortest Pa...
Sort
View
SYNASC
2005
IEEE
110views Algorithms» more  SYNASC 2005»
14 years 1 months ago
Performance Tuning of Evolutionary Algorithms Using Particle Sub Swarms
Particle Swarm Optimization (PSO) technique proved its ability to deal with very complicated optimization and search problems. This paper proposes a new particle swarm variant whi...
Crina Grosan, Ajith Abraham, Monica Nicoara
CRV
2005
IEEE
342views Robotics» more  CRV 2005»
13 years 9 months ago
PDE-Based Robust Robotic Navigation
In robotic navigation, path planning is aimed at getting the optimum collision-free path between a starting and target locations. The optimality criterion depends on the surroundi...
M. Sabry Hassouna, Alaa E. Abdel-Hakim, Aly A. Far...
ICCAD
1999
IEEE
99views Hardware» more  ICCAD 1999»
14 years 7 hour ago
Concurrent logic restructuring and placement for timing closure
: In this paper, an algorithm for simultaneous logic restructuring and placement is presented. This algorithm first constructs a set of super-cells along the critical paths and the...
Jinan Lou, Wei Chen, Massoud Pedram
ICCV
2007
IEEE
14 years 9 months ago
Global Optimization through Searching Rotation Space and Optimal Estimation of the Essential Matrix
This paper extends the set of problems for which a global solution can be found using modern optimization methods. In particular, the method is applied to estimation of the essent...
Richard I. Hartley, Fredrik Kahl
DISOPT
2010
132views more  DISOPT 2010»
13 years 7 months ago
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...