4860 search results - page 422 / 972 » SNPs Problems, Complexity, and Algorithms |
124
Voted
ICRA
2003
IEEE
15 years 9 months ago
2003
IEEE
Existing task allocation algorithms generally do not consider the effects of task interaction, such as interference, but instead assume that tasks are independent. That assumptio...
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
151
click to vote
IANDC
2007
15 years 3 months ago
2007
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
147
click to vote
MST
2011
14 years 10 months ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
108
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
The locally linear embedding (LLE) algorithm is considered as a powerful method for the problem of nonlinear dimensionality reduction. In this paper, first, a new method called cl...