GlobalView

Showing items 1 - 7 of 7.

Add to Quick Collection   All 7 Results

  • First
  • Previous
  • 1
  • Next
  • Last
Sort:
 Add All Items to Quick Collection
Date: 2017
Language: eng
Resource Type: thesis
Identifier: http://hdl.handle.net/1959.13/1338008
Description: Research Doctorate - Doctor of Philosophy (PhD)
Date: 2016
Language: eng
Resource Type: book chapter
Identifier: http://hdl.handle.net/1959.13/1343591
Description: Memetic algorithms (MAs) constitute a search and optimization paradigm based on the orchestrated interplay between global and local search components, and have the exploitation of specific problem kno... More
Date: 2012
Language: eng
Resource Type: book chapter
Identifier: http://hdl.handle.net/1959.13/1325449
Description: Bioinformatics is an exciting research field for memetic algorithms (MAs). Its core activity is the integration of techniques from Computer Science, Mathematics and Statistics to address challenging c... More
Date: 2009
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/1057723
Description: The job-shop scheduling problem is well known for its complexity as an NP-hard problem. We have considered JSSPs with an objective of minimizing makespan while satisfying a number of hard constraints.... More
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: book chapter
Identifier: http://hdl.handle.net/1959.13/35375
Description: The term memetic algorithms (MAs) was introduced in the late 1980s to denote a family of metaheuristics that have as central theme the hybridization of different algorithmic approaches for a given pro... More
Date: 2005
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.13/25227
Description: This paper addresses the Microarray Gene Ordering problem. It consists in ordering a set of genes, grouping together the ones with similar behavior. This behavior can be measured as the gene’s activit... More
Full Text: Full Text
Image Thumbnail
Date: 2003
Language: eng
Resource Type: book chapter
Identifier: http://hdl.handle.net/1959.13/35282
Description: The Number Partitioning Problem (MNP) remains as one of the simplest-to-describe yet hardest-to-solve combinatorial optimization problems. In this paper we use the MNP as a surrogate for several relat... More
  • First
  • Previous
  • 1
  • Next
  • Last