Sciweavers

4112 search results - page 14 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
BMCBI
2010
161views more  BMCBI 2010»
14 years 9 months ago
LTC: a novel algorithm to improve the efficiency of contig assembly for physical mapping in complex genomes
Background: Physical maps are the substrate of genome sequencing and map-based cloning and their construction relies on the accurate assembly of BAC clones into large contigs that...
Zeev Frenkel, Etienne Paux, David I. Mester, Cathe...
64
Voted
CORR
2010
Springer
70views Education» more  CORR 2010»
14 years 9 months ago
A Generalized Coupon Collector Problem
This paper provides analysis to a generalized version of the coupon collector problem, in which the collector gets d coupons each run and he chooses the one that he has the least ...
Weiyu Xu, Ao Kevin Tang
ICIC
2007
Springer
15 years 5 months ago
An Improved Nested Partitions Algorithm Based on Simulated Annealing in Complex Decision Problem Optimization
: - This paper introduces the main ideas of the nested partitions (NP) method, analyses its efficiency theoretically and proposes the way to improve the optimization efficiency of ...
Yan Luo, Changrui Yu
EVOW
2010
Springer
15 years 3 months ago
Local Search Algorithms on Graphics Processing Units. A Case Study: The Permutation Perceptron Problem
Optimization problems are more and more complex and their resource requirements are ever increasing. Although metaheuristics allow to significantly reduce the computational complex...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
ICMLA
2004
15 years 1 months ago
Satisficing Q-learning: efficient learning in problems with dichotomous attributes
In some environments, a learning agent must learn to balance competing objectives. For example, a Q-learner agent may need to learn which choices expose the agent to risk and whic...
Michael A. Goodrich, Morgan Quigley