13376 search results - page 270 / 2676 » Problem Solving with |
144
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
146
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
This paper proposes an adaptive dominance mechanism for diploidy genetic algorithms in dynamic environments. In this scheme, the genotype to phenotype mapping in each gene locus i...
124
click to vote
ICWL
2007
Springer
15 years 10 months ago
2007
Springer
Intelligent Tutoring Systems have made great strides in recent years. Many of these gains have been achieved for welldefined problems. However, solving ill-defined problems is imp...
130
Voted
CVPR
1999
IEEE
15 years 8 months ago
1999
IEEE
We present an algorithm to solve the sensor planning problem for a trinocular, active vision system. This algorithm uses an iterative optimization method to rst solve for the tran...
114
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract-- Interior-point algorithms constitute a very interesting class of algorithms for solving linear-programming problems. In this paper we study efficient implementations of ...