1983 search results - page 280 / 397 » Competitive graph searches |
GECCO
2010
Springer
14 years 1 months ago
2010
Springer
Divide-and-Evolve (DaE) is an original “memeticization” of Evolutionary Computation and Artificial Intelligence Planning. However, like any Evolutionary Algorithm, DaE has se...
GECCO
2009
Springer
14 years 1 months ago
2009
Springer
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
CP
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
CPM
2000
Springer
14 years 1 months ago
2000
Springer
We present a new index for approximate string matching. The index collects text q-samples, that is, disjoint text substrings of length q, at fixed intervals and stores their posi...
HICSS
1998
IEEE
14 years 1 months ago
1998
IEEE
Compared with traditional business operations, wwwbased commerce has many advantages, such as timeliness, worldwide communication, hyper-links, and multimedia. However, lack of cu...