Sciweavers

641 search results - page 91 / 129
» Branch and Bound Algorithm Selection by Performance Predicti...
Sort
View
CPAIOR
2008
Springer
14 years 11 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
90
Voted
ICIP
2001
IEEE
15 years 11 months ago
N-dimensional zonal algorithms. The future of block based motion estimation?
The popularity of zonal based algorithms for block based motion estimation has been recently increasing due to their superior performance in both terms of reduced complexity and s...
Alexis M. Tourapis, Hye-Yeon Cheong, Ming L. Liou,...
BMCBI
2011
14 years 4 months ago
Detection of viral sequence fragments of HIV-1 subfamilies yet unknown
Background: Methods of determining whether or not any particular HIV-1 sequence stems - completely or in part - from some unknown HIV-1 subtype are important for the design of vac...
Thomas Unterthiner, Anne-Kathrin Schultz, Jan Bull...
COMCOM
2006
80views more  COMCOM 2006»
14 years 9 months ago
The prediction-based routing in optical transport networks
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...
Eva Marín-Tordera, Xavier Masip-Bruin, Serg...
BMCBI
2010
175views more  BMCBI 2010»
14 years 9 months ago
Calibur: a tool for clustering large numbers of protein decoys
Background: Ab initio protein structure prediction methods generate numerous structural candidates, which are referred to as decoys. The decoy with the most number of neighbors of...
Shuai Cheng Li, Yen Kaow Ng