9119 search results - page 215 / 1824 » A Simultaneous Search Problem |
170
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
Many-objective problems are difficult to solve using conventional multi-objective evolutionary algorithms (MOEAs) as these algorithms rely primarily on Pareto ranking to guide the ...
159
click to vote
ICTAI
2006
IEEE
16 years 17 days ago
2006
IEEE
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
162
click to vote
CONIELECOMP
2005
IEEE
16 years 4 days ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
163
click to vote
AAAI
2000
15 years 7 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
175
click to vote
IJCNN
2006
IEEE
16 years 17 days ago
2006
IEEE
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...