135 search results - page 16 / 27 » Competitive Searching in a Generalized Street |
122
Voted
ENC
2005
IEEE
15 years 7 months ago
2005
IEEE
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
116
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
120
click to vote
CPM
2010
Springer
15 years 6 months ago
2010
Springer
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...
129
click to vote
CEC
2010
IEEE
15 years 2 months ago
2010
IEEE
— Capacitated arc routing problem (CARP) has attracted much attention due to its generality to many real world problems. Memetic algorithm (MA), among other metaheuristic search ...
WWW
2008
ACM
16 years 2 months ago
2008
ACM
Ontology mapping seeks to find semantic correspondences between similar elements of different ontologies. This paper proposes a neural network based approach to search for a globa...