7864 search results - page 458 / 1573 » Clustering Genetic Algorithm |
246
click to vote
ICTAI
2006
IEEE
16 years 1 months ago
2006
IEEE
We propose a novel algorithm called GA-MDP for solving the frequency assigment problem. GA-MDP inherits the spirit of genetic algorithms with an adaptation of Markov Decision Proc...
241
click to vote
GECCO
2003
Springer
16 years 24 days ago
2003
Springer
Intermediate measurements in quantum circuits compare to conditional branchings in programming languages. Due to this, quantum circuits have a natural linear-tree structure. In thi...
216
click to vote
PPSN
1994
Springer
15 years 11 months ago
1994
Springer
Abstract. The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are binomial distributions for binary strings i...
191
click to vote
AAIM
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
187
click to vote
FSKD
2007
Springer
16 years 1 months ago
2007
Springer
Web users are always distracted by a large number of results returned from search engines. Clustering can efficiently facilitate users’ browsing pages of certain topic. However...