352 search results - page 23 / 71 » On implementation choices for iterative improvement partitio... |
103
click to vote
ICRA
2002
IEEE
15 years 6 months ago
2002
IEEE
As a general framework to determine a collision-free feedback motion strategies, the Random Neighborhood Graph (RNG) approach [19] defines a global navigation function over an ap...
166
Voted
GRID
2010
Springer
14 years 11 months ago
2010
Springer
Abstract The EGEE grid offers the necessary infrastructure and resources for reducing the running time of particle tracking Monte-Carlo applications like GATE. However, efforts are...
156
click to vote
EC
2007
15 years 1 months ago
2007
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
119
Voted
MP
2002
15 years 1 months ago
2002
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...
102
click to vote
GECCO
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...