PhD. Subject: Strategies to design life-long learning heuristic based algorithms

Nowadays combinatorial optimization problems arise in many circumstances, and we need to be able to solve these problems e ciently. Unfortunately, many of these problems are proven to be NP-hard, but problems can be related in some way. Analysing di erent combinatorial problems we can see some simil...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autor principal:	Rojas Morales, Nicolás
Formato:	Objeto de conferencia
Lenguaje:	Inglés
Publicado:	2014
Materias:	Ciencias Informáticas Learning Heuristic methods Algorithms
Acceso en línea:	http://sedici.unlp.edu.ar/handle/10915/41851 http://43jaiio.sadio.org.ar/proceedings/IJCAI/25-26.pdf
Aporte de:	SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

A Genetic Algorithm Based Heuristic for the Design of pCycle Networks
por: Delgadillo, Remberto Emanuel, et al.
Publicado: (2015)

A tabu search heuristic for the equitable coloring problem
por: Méndez Díaz, I., et al.

A tabu search heuristic for the equitable coloring problem
por: Méndez Díaz, Isabel, et al.
Publicado: (2014)

New algorithms for composite retrieval
por: Feuerstein, E., et al.

New algorithms for composite retrieval
por: Méndez Díaz, Isabel, et al.
Publicado: (2017)

Evaluation of a heuristic search algorithm based on sampling and clustering
por: Harita, Maria, et al.
Publicado: (2021)

A GRASP algorithm to solve the problem of dependent tasks scheduling in different machines
por: Tupia Anticona, Manuel
Publicado: (2006)

Genetic algorithms in search, optimization, and machine learning /
por: Goldberg, David E. (David Edward), 1953-
Publicado: (1989)

Genetic algorithms in search, optimization, and machine learning /
por: Goldberg, David E. (David Edward), 1953-
Publicado: (1989)

A study of genotype and phenotype distributions in hybrid evolutionary algorithms to solve the flow shop scheduling problem
por: Minetti, Gabriela F., et al.
Publicado: (2002)

From a heuristic point of view : essays in honour of Carlo Cellucci /
Publicado: (2014)

An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
por: Balseiro, S.R., et al.

An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
por: Loiseau, Irene
Publicado: (2011)

Analysis of web based learning use in a first course of algorithmics
por: Madoz, María Cristina, et al.
Publicado: (2005)

Boundary extraction through gradient-based evolutionary algorithm
por: Katz, Román, et al.
Publicado: (2003)

Metaheurísticas secuenciales y distribuidas: adaptación de parámetros y entornos de ejecución
por: Salto, Carolina, et al.
Publicado: (2013)

A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
por: Kulich, M., et al.

A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
por: Miranda Bront, Juan José
Publicado: (2017)

A little respect (for the role of common components in heuristic search)
por: Chen, Stephen
Publicado: (2006)

Algorithms and ordering heuristics for distributed constraint satisfaction problems
por: Wahbi, Mohamed
Publicado: (2013)

Machine Learning /
por: Mitchell, Tom M. (Tom Michael), 1951-
Publicado: (1997)

A phenotypic analysis of three population-based metaheuristics
por: Orellana, Alina, et al.
Publicado: (2008)

Heurística para TSP-2d euclideo y simétrico basadas en la triangulación de Delaunay y sus subgrafos
por: Krasnogor, Natalio
Publicado: (1997)

The master algorithm: how the quest for the ultimate learning machine will remake our world : Pedro Domingos. Basic Books. 2015. ISBN 978-0465065707
por: Hasperué, Waldo
Publicado: (2015)

In pursuit of the PhD /
por: Bowen, William G.
Publicado: (1992)

Algorithmic identification of probabilities is hard
por: Bienvenu, L., et al.

Algorithmic identification of probabilities is hard
Publicado: (2018)

Unsupervised machine learning algorithms as support tools in molecular dynamics simulations
por: Rim, Daniela, et al.
Publicado: (2019)

Metaheurísticas avanzadas aplicadas a problemas de optimización
por: Villagra, Silvia, et al.
Publicado: (2015)

Comparative analysis of the method of assignment by classes in GAVaPS
por: Lanzarini, Laura Cristina, et al.
Publicado: (2000)

Evaluation of the quality of the ”Montecarlo plus K-means” heuristics using benchmark functions
por: Harita, Maria, et al.
Publicado: (2020)

Multilevel + Neural Network Heuristic for the Graph Bisection Problem on Geometrically Connected Graphs
por: Hernandez, G., et al.
Publicado: (2010)

Prediction, learning, and games /
por: Cesa-Bianchi, Nicolò, 1963-
Publicado: (2006)

Teaching modern heuristics in combinatorial optimization : The example of a demonstration and research tool employing metaheuristics in scheduling
por: Geiger, Martin Josef
Publicado: (2006)

Ant based heuristic for OS service distribution on ad hoc networks
por: Heimfarth, Tales, et al.
Publicado: (2006)

A GRASP algorithm with tree based local search for designing a survivable wide area network backbone
por: Cancela, Héctor, et al.
Publicado: (2004)

Supervising the PhD : a guide to success /
por: Delamont, Sara
Publicado: (1997)

A branch-and-price algorithm for the (k,c)-coloring problem
por: Malaguti, E., et al.

A branch-and-price algorithm for the (k,c)-coloring problem
por: Méndez Díaz, Isabel, et al.
Publicado: (2015)

A column generation algorithm for choice-based network revenue management
por: Bront, J.J.M., et al.