5316 search results - page 184 / 1064 » Which Search Problems Are Random |
104
click to vote
IJCAI
1989
15 years 5 months ago
1989
Most past research work on problem subgoal ordering are of a heuristic nature and very little attempt has been made to reveal the inherent relationship between subgoal ordering co...
149
Voted
EOR
2006
15 years 3 months ago
2006
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
144
click to vote
CEC
2009
IEEE
15 years 10 months ago
2009
IEEE
— In this paper, the performance assessment of the hybrid Archive-based Micro Genetic Algorithm (AMGA) on a set of bound-constrained synthetic test problems is reported. The hybr...
136
Voted
CEC
2010
IEEE
15 years 4 months ago
2010
IEEE
Using a recently proposed model for combinatorial landscapes, Local Optima Networks (LON), we conduct a thorough analysis of two types of instances of the Quadratic Assignment Prob...
143
Voted
SSDBM
2003
IEEE
15 years 9 months ago
2003
IEEE
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...