Sciweavers

1026 search results - page 56 / 206
» An Optimal Solution to Room Search Problem
Sort
View
157
Voted
AAAI
1998
15 years 7 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
145
Voted
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
15 years 9 months ago
Local search for multiobjective function optimization: pareto descent method
Genetic Algorithm (GA) is known as a potent multiobjective optimization method, and the effectiveness of hybridizing it with local search (LS) has recently been reported in the li...
Ken Harada, Jun Sakuma, Shigenobu Kobayashi
164
Voted
ISDA
2009
IEEE
16 years 23 days ago
Valley-Adaptive Clearing Scheme for Multimodal Optimization Evolutionary Search
Recent studies [13, 18] have shown that clearing schemes are efficient multi-modal optimization methods. They efficiently reduce genetic drift which is the direct reason for prema...
Mostafa Mostafa Hashim Ellabaan, Yew-Soon Ong
178
Voted
PROMISE
2010
15 years 26 days ago
The relationship between search based software engineering and predictive modeling
Search Based Software Engineering (SBSE) is an approach to software engineering in which search based optimization algorithms are used to identify optimal or near optimal solution...
Mark Harman
TEC
2002
117views more  TEC 2002»
15 years 5 months ago
A genetic algorithm for shortest path routing problem and the sizing of populations
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
Chang Wook Ahn, Rudrapatna S. Ramakrishna