Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Swetha Varadarajan"'
Publikováno v:
GECCO
While there are many inexact heuristics for generating high quality solutions to the Travelling Salesman Problem, our understanding of why these methods are effective and efficient is still limited. This paper looks at two population based heuristics
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cbfbc201a1f15d9f52cf8fa8070bd122
https://doi.org/10.1145/3377930.3390145
https://doi.org/10.1145/3377930.3390145
Autor:
Swetha Varadarajan, Darrell Whitley
Publikováno v:
GECCO
A new evolutionary algorithm called the Mixing Genetic Algorithm is introduced for the Traveling Salesman Problem. The Mixing Genetic Algorithm does not use selection or mutation, and the children replace the parents every generation. The recombinati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f38b4a83e54380e5bae61d2060e3e148
https://doi.org/10.1145/3321707.3321772
https://doi.org/10.1145/3321707.3321772
Autor:
Swetha Varadarajan
Publikováno v:
RWDSL@CGO
Ribonucleic acid (RNA) is one of the three macromolecules found in mammalian systems. RNA-RNA Interactions (RRI) have found to aid in Cancer research and treatment. But, the problem with the applications that predict these interactions is that they h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::48b15242ac6dad9b632dac2964b67d39
https://doi.org/10.1145/3300111.3300112
https://doi.org/10.1145/3300111.3300112
Autor:
Swetha Varadarajan
Publikováno v:
2019 IEEE/ACM International Symposium on Code Generation and Optimization (CGO).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f72c75795883ac7a0ff1d98e056e18f3
https://doi.org/10.1109/cgo.2019.8661181
https://doi.org/10.1109/cgo.2019.8661181
Publikováno v:
Parallel Problem Solving from Nature – PPSN XV ISBN: 9783319992587
PPSN (2)
PPSN (2)
A number of modern hybrid genetic algorithms do not use mutation. Instead, these algorithms use local search to improve intermediate solutions. This same strategy of combining local search and crossover is also used by stochastic local algorithms, su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d77472621a3b1ef724035005abe74040
https://doi.org/10.1007/978-3-319-99259-4_5
https://doi.org/10.1007/978-3-319-99259-4_5
