14548 search results - page 318 / 2910 » The Optimal Path-Matching Problem |
181
click to vote
NETWORKS
2008
15 years 6 months ago
2008
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
144
click to vote
CG
2002
Springer
15 years 6 months ago
2002
Springer
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
209
click to vote
GECCO
2007
Springer
16 years 24 days ago
2007
Springer
An Estimation of Distribution Algorithm (EDA) is proposed to approach the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines in parallel (HFSSDST-UM) proble...
200
click to vote
JVA
2006
IEEE
16 years 20 days ago
2006
IEEE
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
177
click to vote
EMO
2003
Springer
15 years 12 months ago
2003
Springer
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...