Sciweavers

1206 search results - page 78 / 242
» Convergence analysis of online algorithms
Sort
View
GEM
2007
14 years 11 months ago
Initial Population for Genetic Algorithms: A Metric Approach
- Besides the difficulty of the application problem to be solved with Genetic Algorithms (GAs), an additional difficulty arises because the quality of the solution found, or the ...
Pedro A. Diaz-Gomez, Dean F. Hougen
ICRA
2009
IEEE
92views Robotics» more  ICRA 2009»
15 years 4 months ago
I-Bug: An intensity-based bug algorithm
— This paper introduces a sensor-based planning algorithm that uses less sensing information than any others within the family of bug algorithms. The robot is unable to access pr...
Kamilah Taylor, Steven M. LaValle
SIAMJO
2008
112views more  SIAMJO 2008»
14 years 9 months ago
Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
This paper describes a Parallel Space Decomposition (PSD) technique for the Mesh Adaptive Direct Search (MADS) algorithm. MADS extends Generalized Pattern Search for constrained n...
Charles Audet, J. E. Dennis, Sébastien Le D...
ATAL
2008
Springer
14 years 11 months ago
On the importance of migration for fairness in online grid markets
Computational grids offer users a simple access to tremendous computer resources for solving large scale computing problems. Traditional performance analysis of scheduling algorit...
Lior Amar, Ahuva Mu'alem, Jochen Stößer
WSC
1998
14 years 11 months ago
Using ACCESSIBILITY to Assess the Performance of Generalized Hill Climbing Algorithms
The search problem, ACCESSIBILITY, asks whether a finite sequence of events can be found such that, starting with a specific initial event, a particular state can be reached. This...
Sheldon H. Jacobson, Enver Yücesan