— The high-level synthesis process involves three interdependent and NP-complete optimization problems: (i) the operation scheduling, (ii) the resource allocation, and (iii) the ...
Christian Pilato, Daniele Loiacono, Fabrizio Ferra...
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
This paper examines a real-world application of genetic algorithms – solving the United States Navy’s Sailor Assignment Problem (SAP). The SAP is a complex assignment problem ...
Deon Garrett, Joseph Vannucci, Rodrigo Silva, Dipa...
The problem attempted in this paper is to select a sample from a large set where the sample is required to have a particular average property. The problem can be expressed as an o...
We discuss a theory for a realistic, applicable scaled genetic algorithm (GA) which converges asymptoticly to global optima in a coevolutionary setting involving two species. It is...