Pages that link to "Item:Q1274606"

The following pages link to Enhanced \(A^{*}\) algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases (Q1274606):

Displayed 3 items.

• Controlling the learning process of real-time heuristic search (Q814454) ‎ (← links)
• Average-case analysis of best-first search in two representative directed acyclic graphs (Q814592) ‎ (← links)
• An approximate \(A^{\ast}\) algorithm and its application to the SCS problem. (Q1401210) ‎ (← links)