Sciweavers

617 search results - page 19 / 124
» Local Search for Heuristic Guidance in Tree Search
Sort
View
79
Voted
CEC
2007
IEEE
15 years 1 months ago
Efficient assembling of genome fragments using genetic algorithm enhanced by heuristic search
Abstract-- Shotgun sequencing is the state-of-the-art to decode genome sequence. However this technique needs a lot of fragments. Combining those fragments correctly requires enorm...
Satoko Kikuchi, Goutam Chakraborty
CORR
2010
Springer
117views Education» more  CORR 2010»
14 years 9 months ago
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpos...
Thanasis Balafoutis, Kostas Stergiou
CPC
2008
135views more  CPC 2008»
14 years 9 months ago
Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations
We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depend...
Michael Fuchs
CEC
2003
IEEE
15 years 1 months ago
Phylogenetic trees using evolutionary search: initial progress in extending Gaphyl to work with genetic data
AbstractGaphyl is an application of evolutionary algorithms (EA's) to phylogenetics, an approach used by biologists to investigate evolutionary relationships among organisms. ...
Clare Bates Congdon, Kevin J. Septor
SSIAI
2002
IEEE
15 years 2 months ago
Two Dimensional Projective Point Matching
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...
Jason Denton, J. Ross Beveridge