1589 search results - page 122 / 318 » Multiple-Goal Heuristic Search |
152
Voted
MMB
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
114
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...
138
Voted
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 ...
114
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 ...
168
Voted
EVOW
2007
Springer
15 years 9 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...