1614 search results - page 122 / 323 » Breadth-First Heuristic Search |
122
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
The Boyer-Moore algorithm uses two pre-computed tables for searching a string: skip, which utilizes the occurrence heuristic of symbols in a pattern, and shift, which utilizes the...
152
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
— Future communication networks should be designed with the consideration of efficiently supporting intensive multicast applications. Network coding technique proposed recently ...
121
click to vote
ICDE
2007
IEEE
15 years 10 months ago
2007
IEEE
Existing index selection tools rely on heuristics to efficiently search within the large space of alternative solutions and to minimize the overhead of using the query optimizer ...
177
click to vote
EVOW
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
144
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
Abstract. This paper presents a Parallel Hybrid Evolutionary Metaheuristic for the Period Vehicle Routing Problem PVRP. The PRVP generalizes the classical Vehicle Routing Problem b...