173 search results - page 28 / 35 » The Fastest and Shortest Algorithm for All Well-Defined Prob... |
WABI
2010
Springer
13 years 6 months ago
2010
Springer
Background: Although many RNA molecules contain pseudoknots, computational prediction of pseudoknotted RNA structure is still in its infancy due to high running time and space con...
SMA
2003
ACM
14 years 1 months ago
2003
ACM
Dimensional reduction is a simplification technique that eliminates one or more dimensions from a boundary value problem. It results in significant computational savings with mini...
COMCOM
2006
13 years 7 months ago
2006
In optical networks, the traditional routing problem is generally decoupled into two subproblems, the route selection and the wavelength assignment. Usual RWA (Routing and Wavelen...
WABI
2007
Springer
14 years 1 months ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
ADC
2003
Springer
14 years 1 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...