Sciweavers

17760 search results - page 58 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
BMCBI
2007
107views more  BMCBI 2007»
13 years 10 months ago
A general and efficient method for estimating continuous IBD functions for use in genome scans for QTL
Background: Identity by descent (IBD) matrix estimation is a central component in mapping of Quantitative Trait Loci (QTL) using variance component models. A large number of algor...
Francois Besnier, Örjan Carlborg
LION
2007
Springer
198views Optimization» more  LION 2007»
14 years 4 months ago
Multiobjective Landscape Analysis and the Generalized Assignment Problem
The importance of tuning a search algorithm for the specific features of the target search space has been known for quite some time. However, when dealing with multiobjective prob...
Deon Garrett, Dipankar Dasgupta
EJC
2007
13 years 10 months ago
Quickly deciding minor-closed parameters in general graphs
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
SIGMOD
1997
ACM
146views Database» more  SIGMOD 1997»
14 years 2 months ago
Concurrency and Recovery in Generalized Search Trees
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
Marcel Kornacker, C. Mohan, Joseph M. Hellerstein
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
13 years 1 months ago
A hybrid heuristic approach for solving the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
Petrica C. Pop, Serban Iordache