14548 search results - page 412 / 2910 » The Optimal Path-Matching Problem |
111
click to vote
GECCO
2003
Springer
16 years 2 hour ago
2003
Springer
Abstract. As a preprocessing for genetic algorithms, static reordering helps genetic algorithms effectively create and preserve high-quality schemata, and consequently improves th...
174
click to vote
ISAAC
2003
Springer
15 years 12 months ago
2003
Springer
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
143
click to vote
ISAAC
2001
Springer
15 years 11 months ago
2001
Springer
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
187
click to vote
IJCNN
2000
IEEE
15 years 11 months ago
2000
IEEE
In our recent work, a general method called the stable state analysis technique was developed to determine constraints that the weights in the Hopfield energy function must satisf...
190
click to vote
CC
2006
Springer
15 years 10 months ago
2006
Springer
We show that classic PRE is also a maximum flow problem, thereby revealing the missing link between classic and speculative PRE, and more importantly, establishing a common high-le...