subject:(genetic algorithm)

Wake Forest University

1. Cui, Jinku. A Pareto based Genetic Algorithm for Virtual Local Area Network Optimization.

Degree: 2020, Wake Forest University

► Given a network policy, it is a challenge to create a configuration, which optimizes the security and functionality of networked computers. Virtual Local Access Network… (more)

Subjects/Keywords: Genetic Algorithm

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Cui, J. (2020). A Pareto based Genetic Algorithm for Virtual Local Area Network Optimization. (Thesis). Wake Forest University. Retrieved from http://hdl.handle.net/10339/96856

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Cui, Jinku. “A Pareto based Genetic Algorithm for Virtual Local Area Network Optimization.” 2020. Thesis, Wake Forest University. Accessed February 26, 2021. http://hdl.handle.net/10339/96856.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Cui, Jinku. “A Pareto based Genetic Algorithm for Virtual Local Area Network Optimization.” 2020. Web. 26 Feb 2021.

Vancouver:

Cui J. A Pareto based Genetic Algorithm for Virtual Local Area Network Optimization. [Internet] [Thesis]. Wake Forest University; 2020. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/10339/96856.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cui J. A Pareto based Genetic Algorithm for Virtual Local Area Network Optimization. [Thesis]. Wake Forest University; 2020. Available from: http://hdl.handle.net/10339/96856

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

2. Wegrzyn, Dominik. Creating 3D object descriptors using a genetic algorithm.

Degree: 2013, RCAAP

URL: https://www.rcaap.pt/detail.jsp?id=oai:ubibliorum.ubi.pt:10400.6/3694

► In the technological world that we live in, the need for computer vision became almost as important as human vision. We are surrounded be all… (more)

Subjects/Keywords: Genetic algorithm; Genetic algorithm - Object 3D

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Wegrzyn, D. (2013). Creating 3D object descriptors using a genetic algorithm. (Thesis). RCAAP. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:ubibliorum.ubi.pt:10400.6/3694

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Wegrzyn, Dominik. “Creating 3D object descriptors using a genetic algorithm.” 2013. Thesis, RCAAP. Accessed February 26, 2021. https://www.rcaap.pt/detail.jsp?id=oai:ubibliorum.ubi.pt:10400.6/3694.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Wegrzyn, Dominik. “Creating 3D object descriptors using a genetic algorithm.” 2013. Web. 26 Feb 2021.

Vancouver:

Wegrzyn D. Creating 3D object descriptors using a genetic algorithm. [Internet] [Thesis]. RCAAP; 2013. [cited 2021 Feb 26]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:ubibliorum.ubi.pt:10400.6/3694.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wegrzyn D. Creating 3D object descriptors using a genetic algorithm. [Thesis]. RCAAP; 2013. Available from: https://www.rcaap.pt/detail.jsp?id=oai:ubibliorum.ubi.pt:10400.6/3694

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Anna University

3. Vimal kumar D. Different approaches for miningassociation rules from Multi relational databases;.

Degree: Different approaches for miningassociation rules from Multi relational databases, 2015, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/34202

►

Defining a multi relational pattern that is suitably meaningful and discovering vital information through efficient mining algorithm is a challenging problem and significant works have… (more)

Subjects/Keywords: Genetic algorithm; Mining algorithm; Optimization algorithm

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

D, V. k. (2015). Different approaches for miningassociation rules from Multi relational databases;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/34202

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

D, Vimal kumar. “Different approaches for miningassociation rules from Multi relational databases;.” 2015. Thesis, Anna University. Accessed February 26, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/34202.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

D, Vimal kumar. “Different approaches for miningassociation rules from Multi relational databases;.” 2015. Web. 26 Feb 2021.

Vancouver:

D Vk. Different approaches for miningassociation rules from Multi relational databases;. [Internet] [Thesis]. Anna University; 2015. [cited 2021 Feb 26]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/34202.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

D Vk. Different approaches for miningassociation rules from Multi relational databases;. [Thesis]. Anna University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/34202

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Anna University

4. Suganthi, J. Linear system model reduction using Genetic algorithm; -.

Degree: Information and Communication Engineering, 2014, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/27448

►

newlineStability is an important property to be possessed by every system newlineSince most of the systems are non linear in nature the analysis about the… (more)

Subjects/Keywords: Genetic algorithm; Stability

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Suganthi, J. (2014). Linear system model reduction using Genetic algorithm; -. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/27448

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Suganthi, J. “Linear system model reduction using Genetic algorithm; -.” 2014. Thesis, Anna University. Accessed February 26, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/27448.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Suganthi, J. “Linear system model reduction using Genetic algorithm; -.” 2014. Web. 26 Feb 2021.

Vancouver:

Suganthi J. Linear system model reduction using Genetic algorithm; -. [Internet] [Thesis]. Anna University; 2014. [cited 2021 Feb 26]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27448.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Suganthi J. Linear system model reduction using Genetic algorithm; -. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27448

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

McMaster University

5. Ge, Hanqing. DEVELOPMENT OF A GENETIC ALGORITHM APPROACH TO CALIBRATE THE EVPSC MODEL.

Degree: MASc, 2016, McMaster University

URL: http://hdl.handle.net/11375/20570

►

Magnesium is known as one of the lowest density metals. With the increasing importance of fuel economy and the need to reduce weight, magnesium has… (more)

Subjects/Keywords: EVPSC; Genetic Algorithm

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ge, H. (2016). DEVELOPMENT OF A GENETIC ALGORITHM APPROACH TO CALIBRATE THE EVPSC MODEL. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/20570

Chicago Manual of Style (16^th Edition):

Ge, Hanqing. “DEVELOPMENT OF A GENETIC ALGORITHM APPROACH TO CALIBRATE THE EVPSC MODEL.” 2016. Masters Thesis, McMaster University. Accessed February 26, 2021. http://hdl.handle.net/11375/20570.

MLA Handbook (7^th Edition):

Ge, Hanqing. “DEVELOPMENT OF A GENETIC ALGORITHM APPROACH TO CALIBRATE THE EVPSC MODEL.” 2016. Web. 26 Feb 2021.

Vancouver:

Ge H. DEVELOPMENT OF A GENETIC ALGORITHM APPROACH TO CALIBRATE THE EVPSC MODEL. [Internet] [Masters thesis]. McMaster University; 2016. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/11375/20570.

Council of Science Editors:

Ge H. DEVELOPMENT OF A GENETIC ALGORITHM APPROACH TO CALIBRATE THE EVPSC MODEL. [Masters Thesis]. McMaster University; 2016. Available from: http://hdl.handle.net/11375/20570

Anna University

6. Senthil kumar V. Artificial intelligence based Algorithms for the optimal solution Of security constrained thermal unit N Commitment and short term Hydrothermal scheduling problem;.

Degree: Artificial intelligence based Algorithms for the optimal solution Of security constrained thermal unit N Commitment and short term Hydrothermal scheduling problem, 2014, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/28072

►

The main objective of this research is to develop Genetic Algorithm newline GA based algorithms for solving the Unit Commitment UC problems newlinehydrothermal scheduling and… (more)

Subjects/Keywords: Enhanced Genetic Algorithm; Genetic Algorithm; Simple Genetic Algorithm; Unit Commitment

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

V, S. k. (2014). Artificial intelligence based Algorithms for the optimal solution Of security constrained thermal unit N Commitment and short term Hydrothermal scheduling problem;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/28072

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

V, Senthil kumar. “Artificial intelligence based Algorithms for the optimal solution Of security constrained thermal unit N Commitment and short term Hydrothermal scheduling problem;.” 2014. Thesis, Anna University. Accessed February 26, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/28072.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

V, Senthil kumar. “Artificial intelligence based Algorithms for the optimal solution Of security constrained thermal unit N Commitment and short term Hydrothermal scheduling problem;.” 2014. Web. 26 Feb 2021.

Vancouver:

V Sk. Artificial intelligence based Algorithms for the optimal solution Of security constrained thermal unit N Commitment and short term Hydrothermal scheduling problem;. [Internet] [Thesis]. Anna University; 2014. [cited 2021 Feb 26]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/28072.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

V Sk. Artificial intelligence based Algorithms for the optimal solution Of security constrained thermal unit N Commitment and short term Hydrothermal scheduling problem;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/28072

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Manitoba

7. Jegede, Olawale. A Study of the Application of Chaos to the Genetic Algorithm.

Degree: Electrical and Computer Engineering, 2014, University of Manitoba

URL: http://hdl.handle.net/1993/23428

► This work focuses on the use of a genetic algorithm for optimization in a search-based problem. The Genetic Algorithm (GA) is a subset of evolutionary… (more)

▼ This work focuses on the use of a genetic algorithm for optimization in a search-based problem. The Genetic Algorithm (GA) is a subset of evolutionary algorithms that models biological processes to optimize highly complex functions. A GA allows a population composed of many individuals to evolve under specified selection rules to a state that maximizes the “fitness” (i.e. minimize the objective function). A major advantage of using GA over most stochastic techniques is its parallelism, which speeds up the simulation results leading to faster convergence. With mutation, the GA is also less likely to get stuck in local minima compared to other stochastic techniques. However, some notable drawbacks of the Standard GA (SGA) include slow convergence and a possibility of being stuck in local optimum solution. The SGA uses a random process to generate parameter values for the initial population generation, crossover and mutation processes. Random number generators are designed to result in either uniform distributions or Gaussian distributions. We conjecture that the evolutionary processes in genetics are driven by a random non-linear deterministic dynamic process rather than a random non-deterministic process. Therefore, in the GA evolutionary process, a chaotic map is incorporated into the initial population generation, the crossover and mutation processes of the SGA; this is termed the Chaotic GA (CGA). The properties of a chaotic system that provides additional benefits over randomly generated solutions are sensitivity to initial conditions, topological density and topological transitivity (robust diversity). These properties ensure that the CGA is able to explore the entire solution space. Introducing chaos into the whole process of a standard genetic algorithm may help improve convergence time and accuracy. Simulation was done using Matlab and Java. Advisors/Committee Members: Ferens, Ken (Electrical and Computer Engineering) (supervisor), McLeod, Bob (Elec. & Comp. Eng.) Deng, Chuang (Mech. & Mfg. Eng.) (examiningcommittee).

Subjects/Keywords: Genetic Algorithm; Chaotic Genetic Algorithm; Minimum EST; Maximum EST; Directed Acyclic Graph; Standard Genetic Algorithm

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Jegede, O. (2014). A Study of the Application of Chaos to the Genetic Algorithm. (Masters Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/23428

Chicago Manual of Style (16^th Edition):

Jegede, Olawale. “A Study of the Application of Chaos to the Genetic Algorithm.” 2014. Masters Thesis, University of Manitoba. Accessed February 26, 2021. http://hdl.handle.net/1993/23428.

MLA Handbook (7^th Edition):

Jegede, Olawale. “A Study of the Application of Chaos to the Genetic Algorithm.” 2014. Web. 26 Feb 2021.

Vancouver:

Jegede O. A Study of the Application of Chaos to the Genetic Algorithm. [Internet] [Masters thesis]. University of Manitoba; 2014. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/1993/23428.

Council of Science Editors:

Jegede O. A Study of the Application of Chaos to the Genetic Algorithm. [Masters Thesis]. University of Manitoba; 2014. Available from: http://hdl.handle.net/1993/23428

University of Auckland

8. Savage, Matthew James Waipurukuma. A design framework and genetic algorithm for digital design optimisation on FPGAs.

Degree: 2009, University of Auckland

URL: http://hdl.handle.net/2292/4523

► Design tools of ever increasing power are required to keep pace with technological improvements in chip production. Chip capacities continually increase meaning that designs previously… (more)

▼ Design tools of ever increasing power are required to keep pace with technological improvements in chip production. Chip capacities continually increase meaning that designs previously unfeasible become feasible. These designs are typically more complex and larger than their predecessors. Usually, the time available to a designer does not increase at the same rate. A designer is therefore tasked with a greater work load and a very limited amount of time. Design tools and automation are therefore necessary to compensate for this situation. The limiting characteristics of a design tool are its ease of use, the range of systems it can be applied to, and the quality of results obtained. Should a design tool lack in any of these three areas it will be of limited benefit. This work addresses only the quality of results obtained. While the other two are essential, they are unlikely to be relevant to a design tool if that tool is not adopted because the results were of insufficient quality. A design framework is proposed for the digital design of systems on FPGAs. This framework sets out the processes for producing a system specification of the design problem encountered, and then gives a procedure for processing that specification to produce a set of pareto-optimal designs in VHDL to implement the specification. The actual mapping of a specification to a VHDL design, is held in a mapping string that allows optimisation to be separated from other stages in the design framework. A new genetic algorithm, the Adaptive Speciation Genetic Algorithm (ASGA), is proposed featuring a customised selection, crossover, and mutation operator. This algorithm is assessed against other genetic algorithms from the literature on a knapsack problem and three digital design case studies. These case studies were the design of a parameter estimation circuit for a Self-Tuning Regulator (STR), the design of a Sum-of-Absolute- Difference (SAD) function for video motion detection problems, and the design of a five state Extended Kalman Filter (EKF). Results indicated that ASGA had good performance in all these problems. Through tests against other genetic algorithms, it was found the ASGA???s selection operator was inferior in some cases to that of the Pareto Envelope Selection Algorithm (PESA) by 3 Corne et al. By incorporating the selection operator of PESA performance improvements could be gained in the EKF problem. Advisors/Committee Members: Professor Zoran Salcic, Associate Professor Grant Covic, Dr George Coghill.

Subjects/Keywords: genetic algorithm; digital design; FPGA

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Savage, M. J. W. (2009). A design framework and genetic algorithm for digital design optimisation on FPGAs. (Doctoral Dissertation). University of Auckland. Retrieved from http://hdl.handle.net/2292/4523

Chicago Manual of Style (16^th Edition):

Savage, Matthew James Waipurukuma. “A design framework and genetic algorithm for digital design optimisation on FPGAs.” 2009. Doctoral Dissertation, University of Auckland. Accessed February 26, 2021. http://hdl.handle.net/2292/4523.

MLA Handbook (7^th Edition):

Savage, Matthew James Waipurukuma. “A design framework and genetic algorithm for digital design optimisation on FPGAs.” 2009. Web. 26 Feb 2021.

Vancouver:

Savage MJW. A design framework and genetic algorithm for digital design optimisation on FPGAs. [Internet] [Doctoral dissertation]. University of Auckland; 2009. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/2292/4523.

Council of Science Editors:

Savage MJW. A design framework and genetic algorithm for digital design optimisation on FPGAs. [Doctoral Dissertation]. University of Auckland; 2009. Available from: http://hdl.handle.net/2292/4523

Anna University

9. Senathipathi K. Behavioural biometric authentication with reference to keystroke dynamics;.

Degree: Behavioural biometric authentication with reference to keystroke dynamics, 2015, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/41935

►

Computer security has become an indispensable and critical aspect in the motif evolution and application of computer Since cyber crime and security remain the dominant… (more)

Subjects/Keywords: Biometric authentication; Genetic algorithm

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

K, S. (2015). Behavioural biometric authentication with reference to keystroke dynamics;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/41935

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

K, Senathipathi. “Behavioural biometric authentication with reference to keystroke dynamics;.” 2015. Thesis, Anna University. Accessed February 26, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/41935.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

K, Senathipathi. “Behavioural biometric authentication with reference to keystroke dynamics;.” 2015. Web. 26 Feb 2021.

Vancouver:

K S. Behavioural biometric authentication with reference to keystroke dynamics;. [Internet] [Thesis]. Anna University; 2015. [cited 2021 Feb 26]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/41935.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

K S. Behavioural biometric authentication with reference to keystroke dynamics;. [Thesis]. Anna University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/41935

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Dalhousie University

10. Zhang, Zichen. VISION-BASED GRASP PLANNING OF 3D OBJECTS USING GENETIC ALGORITHM.

Degree: Master of Applied Science, Department of Electrical & Computer Engineering, 2012, Dalhousie University

URL: http://hdl.handle.net/10222/15185

► Vision-based grasp planning can be approached as an optimization problem, where a hand configuration that indicates a stable grasp needs to be located in a… (more)

Subjects/Keywords: Grasp Planning; Genetic Algorithm

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zhang, Z. (2012). VISION-BASED GRASP PLANNING OF 3D OBJECTS USING GENETIC ALGORITHM. (Masters Thesis). Dalhousie University. Retrieved from http://hdl.handle.net/10222/15185

Chicago Manual of Style (16^th Edition):

Zhang, Zichen. “VISION-BASED GRASP PLANNING OF 3D OBJECTS USING GENETIC ALGORITHM.” 2012. Masters Thesis, Dalhousie University. Accessed February 26, 2021. http://hdl.handle.net/10222/15185.

MLA Handbook (7^th Edition):

Zhang, Zichen. “VISION-BASED GRASP PLANNING OF 3D OBJECTS USING GENETIC ALGORITHM.” 2012. Web. 26 Feb 2021.

Vancouver:

Zhang Z. VISION-BASED GRASP PLANNING OF 3D OBJECTS USING GENETIC ALGORITHM. [Internet] [Masters thesis]. Dalhousie University; 2012. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/10222/15185.

Council of Science Editors:

Zhang Z. VISION-BASED GRASP PLANNING OF 3D OBJECTS USING GENETIC ALGORITHM. [Masters Thesis]. Dalhousie University; 2012. Available from: http://hdl.handle.net/10222/15185

Rochester Institute of Technology

11. Collea, Brady. Efficient Algorithms for Unrelated Parallel Machine Scheduling Considering Time of Use Pricing and Demand Charges.

Degree: MS, Industrial and Systems Engineering, 2020, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/10390

► There is an ever-increasing focus on sustainability and energy consumption worldwide. Manufacturing is one of the major areas where energy reduction is not only… (more)

Subjects/Keywords: Genetic algorithm; Heuristic; TOU

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Collea, B. (2020). Efficient Algorithms for Unrelated Parallel Machine Scheduling Considering Time of Use Pricing and Demand Charges. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/10390

Chicago Manual of Style (16^th Edition):

Collea, Brady. “Efficient Algorithms for Unrelated Parallel Machine Scheduling Considering Time of Use Pricing and Demand Charges.” 2020. Masters Thesis, Rochester Institute of Technology. Accessed February 26, 2021. https://scholarworks.rit.edu/theses/10390.

MLA Handbook (7^th Edition):

Collea, Brady. “Efficient Algorithms for Unrelated Parallel Machine Scheduling Considering Time of Use Pricing and Demand Charges.” 2020. Web. 26 Feb 2021.

Vancouver:

Collea B. Efficient Algorithms for Unrelated Parallel Machine Scheduling Considering Time of Use Pricing and Demand Charges. [Internet] [Masters thesis]. Rochester Institute of Technology; 2020. [cited 2021 Feb 26]. Available from: https://scholarworks.rit.edu/theses/10390.

Council of Science Editors:

Collea B. Efficient Algorithms for Unrelated Parallel Machine Scheduling Considering Time of Use Pricing and Demand Charges. [Masters Thesis]. Rochester Institute of Technology; 2020. Available from: https://scholarworks.rit.edu/theses/10390

12. Kumar, Anand. Network design using Genetic Algorithm.

Degree: 2010, Saurashtra University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/2298

►

Network Design Problems are becoming increasingly critical & complex as telecommunication networks (and others) are expanded & upgraded in response to consumer’s information needs. Network… (more)

▼

Network Design Problems are becoming increasingly critical & complex as telecommunication networks (and others) are expanded & upgraded in response to consumer’s information needs. Network design is used extensively in practice in an ever expanding spectrum of applications. Network optimization models such as shortest path, assignment, maxflow, transportation, transshipment, spanning tree, matching, traveling salesman, generalized assignment, vehicle routing, and multicommodity flow constitute the most common class of practical network optimization problems. In this research work, a generalized network design problems (NDPs) is focused in the form of a large scale backbone network which belong to the family of NP-hard combinatorial optimization problems. The purpose of the backbone is to connect regional distribution networks and, in some instances, to provide connectivity to other peer networks. The primary objective of this research work is to develop a robust method based on genetic algorithm to solve NP-hard network design problem with minimum cost subject to a reliability constraint which meets the customer requirement. One fundamental problem in this area is the minimum spanning tree (MST) problem where all nodes in a graph have to be linked together in a circle-free structure in the cheapest possible way. The MST problem itself is easy to solve by polynomial-time algorithms like those of Prim or Kruskal, but adding additional constraints often make the corresponding optimization problem a hard one. One of these related problems is the degree-constrained MST problem, in which degree of each node is restricted with in a given range which is very important for the reliability and priority of the connecting node. Other possible constraints are path failure, node failure and connectivity which are requirement of the current network system. By adding this constraint, this network design problem becomes one of the hardest problems in NP-hard category. Due to the complexity of the problem these approaches are limited to relatively small instances with clearly less than 100 nodes when considering complete graphs. Therefore, in this research work methods have been developed to solve instances with up to 1000 and are applicable for more than 1000 nodes.

Abstract includs, Bibliography p.232-236

Advisors/Committee Members: Jani, N N.

Subjects/Keywords: Network design; Networking; Genetic Algorithm

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kumar, A. (2010). Network design using Genetic Algorithm. (Thesis). Saurashtra University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/2298

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Kumar, Anand. “Network design using Genetic Algorithm.” 2010. Thesis, Saurashtra University. Accessed February 26, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/2298.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Kumar, Anand. “Network design using Genetic Algorithm.” 2010. Web. 26 Feb 2021.

Vancouver:

Kumar A. Network design using Genetic Algorithm. [Internet] [Thesis]. Saurashtra University; 2010. [cited 2021 Feb 26]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/2298.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kumar A. Network design using Genetic Algorithm. [Thesis]. Saurashtra University; 2010. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/2298

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

13. Ragheb toemeh. Certain investigations in Cryptanalysis of classical ciphers Using genetic algorithm;.

Degree: Certain investigations in Cryptanalysis of classical ciphers Using genetic algorithm, 2014, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/26543

►

The aim of the research presented in this thesis is to investigate the newlineuse of Genetic Algorithm GA in the cryptanalysis of some classical ciphers… (more)

Subjects/Keywords: Cryptanalysis; Genetic Algorithm; Transposition Ciphers

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

toemeh, R. (2014). Certain investigations in Cryptanalysis of classical ciphers Using genetic algorithm;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/26543

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

toemeh, Ragheb. “Certain investigations in Cryptanalysis of classical ciphers Using genetic algorithm;.” 2014. Thesis, Anna University. Accessed February 26, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/26543.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

toemeh, Ragheb. “Certain investigations in Cryptanalysis of classical ciphers Using genetic algorithm;.” 2014. Web. 26 Feb 2021.

Vancouver:

toemeh R. Certain investigations in Cryptanalysis of classical ciphers Using genetic algorithm;. [Internet] [Thesis]. Anna University; 2014. [cited 2021 Feb 26]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26543.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

toemeh R. Certain investigations in Cryptanalysis of classical ciphers Using genetic algorithm;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26543

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Wake Forest University

14. Kediyal, Prashant C. Comparison of Possible Optimization Methods for Design of Optical Filters.

Degree: 2004, Wake Forest University

URL: http://hdl.handle.net/10339/14929

► Wavefront coding for extending the depth of focus of imaging systems uses a cubic phase mask which has a single parameter phase variation. Using a… (more)

▼ Wavefront coding for extending the depth of focus of imaging systems uses a cubic phase mask which has a single parameter phase variation. Using a single parameter puts a limitation on optimizing the function that serves as criteria for characterizing invariance in depth of focus of a filter. Pupil phase engineering builds on wavefront coding by using a multi-parameter filter. Global optimization of these multidimensional filters with a conventional sequentially implemented method like Simulated Annealing can take time in the order of several days and even weeks to optimize on a single machine. Hence there is a need to address this issue by an algorithm that can work over a network of computers in parallel. This thesis uses a freely available Genetic Algorithm package called SUGAL; which allows a lot of configurability and extensibility. By itself, SUGAL does not have a standard parallel run feature, but it allows extensibility so that it can be modified to give a parallel implementation. Due to extensibility of both SUGAL and MATLAB they have been integrated with each other in this thesis. Results of comparison of conventional optimization methods like the BFGS (Broyden-Fletcher-Goldfarb-Shanno) and (the similar but global optimization method) SA (Simulated Annealing) with GA (Genetic Algorithms) give us some important observations. Unlike BFGS, GA is a method for global optimization and when compared to a global optimization method like SA the parallel implementation of the GA did better not only in the time taken, but also in the number of function evaluations required. For functions which do not have gradients, BFGS fails totally and is not an option this highlights why GA are considered better for discrete optimization. In addition BFGS suffers from having to guess good starting points and is affected by fortuitous starts. However, in the vicinity of the solution and for convex problems it is often cheaper to use the BFGS method. It is also observed that GA converges very close to the solution but the final solution, if at all reached, by BFGS or SA is slightly more accurate. This research also suggests that, from among the different ways to run the GA, the hybrid genitor algorithm is better for a parallel implementation simply because the Genitor algorithm can not be implemented in parallel.

Subjects/Keywords: genetic algorithm

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kediyal, P. C. (2004). Comparison of Possible Optimization Methods for Design of Optical Filters. (Thesis). Wake Forest University. Retrieved from http://hdl.handle.net/10339/14929

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Kediyal, Prashant C. “Comparison of Possible Optimization Methods for Design of Optical Filters.” 2004. Thesis, Wake Forest University. Accessed February 26, 2021. http://hdl.handle.net/10339/14929.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Kediyal, Prashant C. “Comparison of Possible Optimization Methods for Design of Optical Filters.” 2004. Web. 26 Feb 2021.

Vancouver:

Kediyal PC. Comparison of Possible Optimization Methods for Design of Optical Filters. [Internet] [Thesis]. Wake Forest University; 2004. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/10339/14929.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kediyal PC. Comparison of Possible Optimization Methods for Design of Optical Filters. [Thesis]. Wake Forest University; 2004. Available from: http://hdl.handle.net/10339/14929

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

15. Cummings, Jonathon Patrick. Optimization Of The GARCH Model Parameters Using A Genetic Algorithm.

Degree: MS, Economics & Finance, 2013, University of North Dakota

URL: https://commons.und.edu/theses/1411

► Financial time series are often characterized by nonlinearity and volatility bunching. Standard regression analysis models cannot capture changing volatilities, potentially leading to erroneous results.… (more)

Subjects/Keywords: GARCH; genetic algorithm; optimization

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Cummings, J. P. (2013). Optimization Of The GARCH Model Parameters Using A Genetic Algorithm. (Masters Thesis). University of North Dakota. Retrieved from https://commons.und.edu/theses/1411

Chicago Manual of Style (16^th Edition):

Cummings, Jonathon Patrick. “Optimization Of The GARCH Model Parameters Using A Genetic Algorithm.” 2013. Masters Thesis, University of North Dakota. Accessed February 26, 2021. https://commons.und.edu/theses/1411.

MLA Handbook (7^th Edition):

Cummings, Jonathon Patrick. “Optimization Of The GARCH Model Parameters Using A Genetic Algorithm.” 2013. Web. 26 Feb 2021.

Vancouver:

Cummings JP. Optimization Of The GARCH Model Parameters Using A Genetic Algorithm. [Internet] [Masters thesis]. University of North Dakota; 2013. [cited 2021 Feb 26]. Available from: https://commons.und.edu/theses/1411.

Council of Science Editors:

Cummings JP. Optimization Of The GARCH Model Parameters Using A Genetic Algorithm. [Masters Thesis]. University of North Dakota; 2013. Available from: https://commons.und.edu/theses/1411

University of Illinois – Chicago

16. Can, Onur. Early Damage Detection in Periodically Assembled Trusses Using Impulse Response Method.

Degree: 2017, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/21874

► Application of genetic algorithms (GA) for optimizing truss geometry is studied with inducing periodicity, and impulse-response based nondestructive evaluation approach is developed using the advantage… (more)

Subjects/Keywords: Genetic algorithm; Impulse response

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Can, O. (2017). Early Damage Detection in Periodically Assembled Trusses Using Impulse Response Method. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/21874

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Can, Onur. “Early Damage Detection in Periodically Assembled Trusses Using Impulse Response Method.” 2017. Thesis, University of Illinois – Chicago. Accessed February 26, 2021. http://hdl.handle.net/10027/21874.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Can, Onur. “Early Damage Detection in Periodically Assembled Trusses Using Impulse Response Method.” 2017. Web. 26 Feb 2021.

Vancouver:

Can O. Early Damage Detection in Periodically Assembled Trusses Using Impulse Response Method. [Internet] [Thesis]. University of Illinois – Chicago; 2017. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/10027/21874.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Can O. Early Damage Detection in Periodically Assembled Trusses Using Impulse Response Method. [Thesis]. University of Illinois – Chicago; 2017. Available from: http://hdl.handle.net/10027/21874

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Delft University of Technology

17. Van Der Steen, J.D. (author). Computational Reuse Optimisation.

Degree: 2014, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:8e9e9fdb-2a39-4758-be25-6aada6c31873

►

Application development for reusing structural stadium elements in a new project and configuration through implementation of a genetic algorithm.

BEMNext Laboratory

Structural Engineering

Civil Engineering… (more)

Subjects/Keywords: Genetic; Algorithm; Stadium; Reuse

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Van Der Steen, J. D. (. (2014). Computational Reuse Optimisation. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:8e9e9fdb-2a39-4758-be25-6aada6c31873

Chicago Manual of Style (16^th Edition):

Van Der Steen, J D (author). “Computational Reuse Optimisation.” 2014. Masters Thesis, Delft University of Technology. Accessed February 26, 2021. http://resolver.tudelft.nl/uuid:8e9e9fdb-2a39-4758-be25-6aada6c31873.

MLA Handbook (7^th Edition):

Van Der Steen, J D (author). “Computational Reuse Optimisation.” 2014. Web. 26 Feb 2021.

Vancouver:

Van Der Steen JD(. Computational Reuse Optimisation. [Internet] [Masters thesis]. Delft University of Technology; 2014. [cited 2021 Feb 26]. Available from: http://resolver.tudelft.nl/uuid:8e9e9fdb-2a39-4758-be25-6aada6c31873.

Council of Science Editors:

Van Der Steen JD(. Computational Reuse Optimisation. [Masters Thesis]. Delft University of Technology; 2014. Available from: http://resolver.tudelft.nl/uuid:8e9e9fdb-2a39-4758-be25-6aada6c31873

Louisiana State University

18. Watkins, Katherine Shepard. An evaluation of alternative approaches for simulating animal movement in spatially-explicit individual-based models.

Degree: PhD, Oceanography and Atmospheric Sciences and Meteorology, 2012, Louisiana State University

URL: etd-06052012-163626 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3139

► Simulating animal movement in spatially-explicit individual-based models (IBMs) is both challenging and critically important to accurately estimating population dynamics. I compared four distinct movement approaches… (more)

▼ Simulating animal movement in spatially-explicit individual-based models (IBMs) is both challenging and critically important to accurately estimating population dynamics. I compared four distinct movement approaches or sub-models (restricted-area search, kinesis, event-based, and run and tumble) in a series of simulation experiments. I used an IBM loosely based on a small pelagic fish that simulated growth, mortality, and movement of a cohort on a 2-dimensional grid. First, I tested the sub-models calibrated (i.e., trained) with a genetic algorithm in one set of environmental conditions in three other novel environments. The sub-models performed well, except restricted-area search and event-based that needed to be trained in environments with gradients similar to the test environment. Also, run and tumble only trained in steep habitat quality gradients. The sub-models were then trained and tested across a range of spatio-temporal resolutions (cell size and time step). The sub-models generally performed well across resolutions, but the sub-models did not perform equally well at all resolutions. Kinesis and run and tumble performed better at coarser resolutions, and restricted-area and event-based performed better at finer resolutions. I attributed the trends across resolution to differences in how the habitat quality individuals experienced changed at each time step. Finally, I trained and tested the sub-models in an IBM with dynamic prey and predator fields. I trained and tested the sub-models in dynamic and static versions of the environment. Sub-models trained in the dynamic environment performed well in both dynamic and static test environments; however, sub-models trained in static environment did not perform consistently well in dynamic test environment. Overall, restricted-area search, kinesis, and event-based were robust across the range of conditions in which I tested them, but run and tumble only performed well in environments with very steep habitat quality gradients. In selecting a movement sub-model, researchers should consider the assumptions of potential sub-models, the observed movement patterns of the species of interest, the shape and steepness of the underlying habitat quality gradient, and the spatio-temporal resolution of the model. Sub-models that will be applied in dynamic conditions should be calibrated in comparable dynamic conditions.

Subjects/Keywords: IBM; behavioral movement; genetic algorithm

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Watkins, K. S. (2012). An evaluation of alternative approaches for simulating animal movement in spatially-explicit individual-based models. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-06052012-163626 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3139

Chicago Manual of Style (16^th Edition):

Watkins, Katherine Shepard. “An evaluation of alternative approaches for simulating animal movement in spatially-explicit individual-based models.” 2012. Doctoral Dissertation, Louisiana State University. Accessed February 26, 2021. etd-06052012-163626 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3139.

MLA Handbook (7^th Edition):

Watkins, Katherine Shepard. “An evaluation of alternative approaches for simulating animal movement in spatially-explicit individual-based models.” 2012. Web. 26 Feb 2021.

Vancouver:

Watkins KS. An evaluation of alternative approaches for simulating animal movement in spatially-explicit individual-based models. [Internet] [Doctoral dissertation]. Louisiana State University; 2012. [cited 2021 Feb 26]. Available from: etd-06052012-163626 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3139.

Council of Science Editors:

Watkins KS. An evaluation of alternative approaches for simulating animal movement in spatially-explicit individual-based models. [Doctoral Dissertation]. Louisiana State University; 2012. Available from: etd-06052012-163626 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3139

Virginia Tech

19. Rich, Jonathan E. Design Optimization Procedure for Monocoque Composite Cylinder Structures Using Response Surface Techniques.

Degree: MS, Engineering Science and Mechanics, 1997, Virginia Tech

URL: http://hdl.handle.net/10919/35512

► An optimization strategy for the design of composite shells is investigated. This study differs from previous work in that an advanced analysis package is utilized… (more)

Subjects/Keywords: genetic algorithm

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Rich, J. E. (1997). Design Optimization Procedure for Monocoque Composite Cylinder Structures Using Response Surface Techniques. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/35512

Chicago Manual of Style (16^th Edition):

Rich, Jonathan E. “Design Optimization Procedure for Monocoque Composite Cylinder Structures Using Response Surface Techniques.” 1997. Masters Thesis, Virginia Tech. Accessed February 26, 2021. http://hdl.handle.net/10919/35512.

MLA Handbook (7^th Edition):

Rich, Jonathan E. “Design Optimization Procedure for Monocoque Composite Cylinder Structures Using Response Surface Techniques.” 1997. Web. 26 Feb 2021.

Vancouver:

Rich JE. Design Optimization Procedure for Monocoque Composite Cylinder Structures Using Response Surface Techniques. [Internet] [Masters thesis]. Virginia Tech; 1997. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/10919/35512.

Council of Science Editors:

Rich JE. Design Optimization Procedure for Monocoque Composite Cylinder Structures Using Response Surface Techniques. [Masters Thesis]. Virginia Tech; 1997. Available from: http://hdl.handle.net/10919/35512

Oklahoma State University

20. Xu, Huawen. Comparison of Genetic Operators on a General Genetic Algorithm Package.

Degree: Computer Science Department, 2005, Oklahoma State University

URL: http://hdl.handle.net/11244/8269

► Genetic Algorithm models the natural selection and evolution process and has been successful in areas where the traditional methods fall short. Most of the existing… (more)

Subjects/Keywords: genetic; algorithm

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Xu, H. (2005). Comparison of Genetic Operators on a General Genetic Algorithm Package. (Thesis). Oklahoma State University. Retrieved from http://hdl.handle.net/11244/8269

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Xu, Huawen. “Comparison of Genetic Operators on a General Genetic Algorithm Package.” 2005. Thesis, Oklahoma State University. Accessed February 26, 2021. http://hdl.handle.net/11244/8269.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Xu, Huawen. “Comparison of Genetic Operators on a General Genetic Algorithm Package.” 2005. Web. 26 Feb 2021.

Vancouver:

Xu H. Comparison of Genetic Operators on a General Genetic Algorithm Package. [Internet] [Thesis]. Oklahoma State University; 2005. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/11244/8269.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Xu H. Comparison of Genetic Operators on a General Genetic Algorithm Package. [Thesis]. Oklahoma State University; 2005. Available from: http://hdl.handle.net/11244/8269

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

21. Lin, Feng-Shih. Improved Approaches for Attribute Clustering Based on the Group Genetic Algorithm.

Degree: Master, Computer Science and Engineering, 2011, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909111-070933

► Feature selection is a pre-processing step in data-mining and machine learning, and plays an important role for analyzing high-dimensional data. Appropriately selected features can not… (more)

Subjects/Keywords: feature selection; genetic algorithm; grouping genetic algorithm; data mining; Attribute clustering

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lin, F. (2011). Improved Approaches for Attribute Clustering Based on the Group Genetic Algorithm. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909111-070933

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Lin, Feng-Shih. “Improved Approaches for Attribute Clustering Based on the Group Genetic Algorithm.” 2011. Thesis, NSYSU. Accessed February 26, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909111-070933.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Lin, Feng-Shih. “Improved Approaches for Attribute Clustering Based on the Group Genetic Algorithm.” 2011. Web. 26 Feb 2021.

Vancouver:

Lin F. Improved Approaches for Attribute Clustering Based on the Group Genetic Algorithm. [Internet] [Thesis]. NSYSU; 2011. [cited 2021 Feb 26]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909111-070933.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lin F. Improved Approaches for Attribute Clustering Based on the Group Genetic Algorithm. [Thesis]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909111-070933

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

22. Chen, Ming-cheng. A GA-Fuzzy-Based Voting Mechanism for Microarray Data Classification.

Degree: Master, Computer Science and Engineering, 2008, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0930108-105834

► The microarray technology plays an important role of clinical oncology field. The patient can be diagnosed a symptom about cancer through microarray data. Currently, to… (more)

Subjects/Keywords: Microarray Data Classification; Genetic Algorithm; Fuzzy Theory

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Chen, M. (2008). A GA-Fuzzy-Based Voting Mechanism for Microarray Data Classification. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0930108-105834

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Chen, Ming-cheng. “A GA-Fuzzy-Based Voting Mechanism for Microarray Data Classification.” 2008. Thesis, NSYSU. Accessed February 26, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0930108-105834.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Chen, Ming-cheng. “A GA-Fuzzy-Based Voting Mechanism for Microarray Data Classification.” 2008. Web. 26 Feb 2021.

Vancouver:

Chen M. A GA-Fuzzy-Based Voting Mechanism for Microarray Data Classification. [Internet] [Thesis]. NSYSU; 2008. [cited 2021 Feb 26]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0930108-105834.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chen M. A GA-Fuzzy-Based Voting Mechanism for Microarray Data Classification. [Thesis]. NSYSU; 2008. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0930108-105834

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

23. Chung, Chi-Hsiu. Achieving Imitation-Based Learning for a Humanoid Robot by Evolutionary Computation.

Degree: Master, Information Management, 2009, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729109-002840

► This thesis presents an imitation-based methodology, also a simple and easy way, for a service robot to learn the behaviors demonstrated by the user. With… (more)

Subjects/Keywords: Genetic Algorithm; Imitation Learning; Robot Learning

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Chung, C. (2009). Achieving Imitation-Based Learning for a Humanoid Robot by Evolutionary Computation. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729109-002840

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Chung, Chi-Hsiu. “Achieving Imitation-Based Learning for a Humanoid Robot by Evolutionary Computation.” 2009. Thesis, NSYSU. Accessed February 26, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729109-002840.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Chung, Chi-Hsiu. “Achieving Imitation-Based Learning for a Humanoid Robot by Evolutionary Computation.” 2009. Web. 26 Feb 2021.

Vancouver:

Chung C. Achieving Imitation-Based Learning for a Humanoid Robot by Evolutionary Computation. [Internet] [Thesis]. NSYSU; 2009. [cited 2021 Feb 26]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729109-002840.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chung C. Achieving Imitation-Based Learning for a Humanoid Robot by Evolutionary Computation. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729109-002840

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

24. Chou, Yan-Chi. Style Music Accompaniment Using a Variable-length Genetic Algorithm with Chord Progression.

Degree: Master, Computer Science and Engineering, 2009, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0910109-163344

► The domain of computer music is an interesting area which combines computer science and music art. We propose a music accompaniment system using a variable-length… (more)

Subjects/Keywords: Chord Progression; Accompaniment; Variable-length Genetic Algorithm

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Chou, Y. (2009). Style Music Accompaniment Using a Variable-length Genetic Algorithm with Chord Progression. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0910109-163344

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Chou, Yan-Chi. “Style Music Accompaniment Using a Variable-length Genetic Algorithm with Chord Progression.” 2009. Thesis, NSYSU. Accessed February 26, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0910109-163344.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Chou, Yan-Chi. “Style Music Accompaniment Using a Variable-length Genetic Algorithm with Chord Progression.” 2009. Web. 26 Feb 2021.

Vancouver:

Chou Y. Style Music Accompaniment Using a Variable-length Genetic Algorithm with Chord Progression. [Internet] [Thesis]. NSYSU; 2009. [cited 2021 Feb 26]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0910109-163344.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chou Y. Style Music Accompaniment Using a Variable-length Genetic Algorithm with Chord Progression. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0910109-163344

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

25. Chiang, Chung-Han. A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences.

Degree: Master, Computer Science and Engineering, 2009, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0106109-080018

► Various approaches have been proposed for finding the longest common subsequence (LCS) of two sequences. The time complexities of these algorithms are usually O(n²) in… (more)

Subjects/Keywords: longest common subsequence; multiple sequences; genetic algorithm

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Chiang, C. (2009). A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0106109-080018

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Chiang, Chung-Han. “A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences.” 2009. Thesis, NSYSU. Accessed February 26, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0106109-080018.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Chiang, Chung-Han. “A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences.” 2009. Web. 26 Feb 2021.

Vancouver:

Chiang C. A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences. [Internet] [Thesis]. NSYSU; 2009. [cited 2021 Feb 26]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0106109-080018.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chiang C. A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0106109-080018

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

26. Tsai, An-Hsiou. Berth Schedule Planning of the Kaohsiung Port by Genetic Algorithms.

Degree: Master, Computer Science and Engineering, 2011, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909111-073639

► For a commercial port, to efficiently schedule the public berths is an important issue. Since a berth schedule would affect the usage of the commercial… (more)

Subjects/Keywords: Berth Scheduling; Genetic Algorithm; Taguchi Method

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Tsai, A. (2011). Berth Schedule Planning of the Kaohsiung Port by Genetic Algorithms. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909111-073639

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Tsai, An-Hsiou. “Berth Schedule Planning of the Kaohsiung Port by Genetic Algorithms.” 2011. Thesis, NSYSU. Accessed February 26, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909111-073639.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Tsai, An-Hsiou. “Berth Schedule Planning of the Kaohsiung Port by Genetic Algorithms.” 2011. Web. 26 Feb 2021.

Vancouver:

Tsai A. Berth Schedule Planning of the Kaohsiung Port by Genetic Algorithms. [Internet] [Thesis]. NSYSU; 2011. [cited 2021 Feb 26]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909111-073639.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tsai A. Berth Schedule Planning of the Kaohsiung Port by Genetic Algorithms. [Thesis]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909111-073639

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Humboldt State University

27. Stobb, Michael T. A dynamic neural network model of the zebrafish posterior lateral line sensorimotor pathway.

Degree: MS, Environmental Systems: Mathematical Modeling, 2012, Humboldt State University

URL: http://hdl.handle.net/2148/1277

► Neural network architecture is an important area of study in Neuroscience, as the possible dynamics of a network are highly dependent on its structure. I… (more)

Subjects/Keywords: Zebrafish; Artificial neural network; Genetic algorithm

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Stobb, M. T. (2012). A dynamic neural network model of the zebrafish posterior lateral line sensorimotor pathway. (Masters Thesis). Humboldt State University. Retrieved from http://hdl.handle.net/2148/1277

Chicago Manual of Style (16^th Edition):

Stobb, Michael T. “A dynamic neural network model of the zebrafish posterior lateral line sensorimotor pathway.” 2012. Masters Thesis, Humboldt State University. Accessed February 26, 2021. http://hdl.handle.net/2148/1277.

MLA Handbook (7^th Edition):

Stobb, Michael T. “A dynamic neural network model of the zebrafish posterior lateral line sensorimotor pathway.” 2012. Web. 26 Feb 2021.

Vancouver:

Stobb MT. A dynamic neural network model of the zebrafish posterior lateral line sensorimotor pathway. [Internet] [Masters thesis]. Humboldt State University; 2012. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/2148/1277.

Council of Science Editors:

Stobb MT. A dynamic neural network model of the zebrafish posterior lateral line sensorimotor pathway. [Masters Thesis]. Humboldt State University; 2012. Available from: http://hdl.handle.net/2148/1277

University of California – Berkeley

28. Wurman, Gilead. Earthquake Early Warning and the Physics of Earthquake Rupture.

Degree: Earth & Planetary Science, 2010, University of California – Berkeley

URL: http://www.escholarship.org/uc/item/8246h4g5

► One of the great debates in seismology today revolves around the question of whether earthquake ruptures are self-similar, cascading failures, or whether their size is… (more)

▼ One of the great debates in seismology today revolves around the question of whether earthquake ruptures are self-similar, cascading failures, or whether their size is somehow predetermined at the start of the rupture. If earthquakes are self-similar there is theoretically no way to determine the magnitude of an event until the rupture has completely terminated, while if it is deterministic the magnitude should be immediately discernible. Recent advances in Earthquake Early Warning methodologies provide new insight into the fundamental physics of earthquake rupture and highlight the importance of understanding the answer to this question.Observations of the amplitude and frequency content of early P-wave arrivals suggest that some information about the final size of an earthquake is already present within a few seconds of the initiation of rupture, in agreement with a host of other observations that show a degree of scaling between large and small earthquakes. While this suggests that earthquakes are deterministic, there is likewise a large body of work, both observational and model-based, that indicates that this is not true and earthquakes are self-similar.This work documents the process of calibrating and testing the ElarmS Earthquake Early Warning methodology in northern California on the Northern California and Berkeley Digital Seismic Networks. In the process the work adds to the body of observations which show a dependency on event magnitude of P-wave frequency content and amplitude. These observations are corroborated with a new set of independent observations of kinematic slip distributions. These new observations indicate that the early slip on a fault also scales with magnitude and suggest again that earthquakes are not entirely self-similar cascading events.In an effort to assign a physical mechanism to the observations of scaling, both in P-waves and in kinematic slip inversions, a hypothetical model is tested wherein the intensity of the early rupture imparts more or less energy to the rupture front and affects the likelihood of the rupture continuing or dying out in the face of unfavorable conditions further along the fault plane. The results of testing this hypothesis are somewhat equivocal, but they are suggestive of the likely truth, that earthquakes exhibit aspects of both deterministic and cascading rupture to some degree. Understanding the details of the interplay between these two aspects is crucial to the successful application of Earthquake Early Warning systems, especially in rare large earthquakes for which there is little empirical data on the performance of these systems.

Subjects/Keywords: Geophysics; Earthquake Warning; Genetic algorithm; Rupture physics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Wurman, G. (2010). Earthquake Early Warning and the Physics of Earthquake Rupture. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/8246h4g5

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Wurman, Gilead. “Earthquake Early Warning and the Physics of Earthquake Rupture.” 2010. Thesis, University of California – Berkeley. Accessed February 26, 2021. http://www.escholarship.org/uc/item/8246h4g5.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Wurman, Gilead. “Earthquake Early Warning and the Physics of Earthquake Rupture.” 2010. Web. 26 Feb 2021.

Vancouver:

Wurman G. Earthquake Early Warning and the Physics of Earthquake Rupture. [Internet] [Thesis]. University of California – Berkeley; 2010. [cited 2021 Feb 26]. Available from: http://www.escholarship.org/uc/item/8246h4g5.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wurman G. Earthquake Early Warning and the Physics of Earthquake Rupture. [Thesis]. University of California – Berkeley; 2010. Available from: http://www.escholarship.org/uc/item/8246h4g5

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Rochester Institute of Technology

29. Kim, Dong. Determining a substitution matrix for the alignment of disordered proteins.

Degree: 2013, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/4317

► As the research of disordered proteins progresses and more disordered protein sequences are discovered, an optimal substitution matrix for the alignment of these sequences… (more)

Subjects/Keywords: Disordered protein; Genetic algorithm; Substitution matrix

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kim, D. (2013). Determining a substitution matrix for the alignment of disordered proteins. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/4317

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Kim, Dong. “Determining a substitution matrix for the alignment of disordered proteins.” 2013. Thesis, Rochester Institute of Technology. Accessed February 26, 2021. https://scholarworks.rit.edu/theses/4317.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Kim, Dong. “Determining a substitution matrix for the alignment of disordered proteins.” 2013. Web. 26 Feb 2021.

Vancouver:

Kim D. Determining a substitution matrix for the alignment of disordered proteins. [Internet] [Thesis]. Rochester Institute of Technology; 2013. [cited 2021 Feb 26]. Available from: https://scholarworks.rit.edu/theses/4317.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kim D. Determining a substitution matrix for the alignment of disordered proteins. [Thesis]. Rochester Institute of Technology; 2013. Available from: https://scholarworks.rit.edu/theses/4317

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Rochester Institute of Technology

30. Kon, Justin. Gait Generation for Damaged Hexapods using Genetic Algorithm.

Degree: MS, Electrical Engineering, 2020, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/10393

► This paper discusses the design and implementation of a Genetic Algorithm for the generation of gaits compensating for system damage on the joint level… (more)

Subjects/Keywords: Damaged controls; Gait generation; Genetic algorithm; Hexapod

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kon, J. (2020). Gait Generation for Damaged Hexapods using Genetic Algorithm. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/10393

Chicago Manual of Style (16^th Edition):

Kon, Justin. “Gait Generation for Damaged Hexapods using Genetic Algorithm.” 2020. Masters Thesis, Rochester Institute of Technology. Accessed February 26, 2021. https://scholarworks.rit.edu/theses/10393.

MLA Handbook (7^th Edition):

Kon, Justin. “Gait Generation for Damaged Hexapods using Genetic Algorithm.” 2020. Web. 26 Feb 2021.

Vancouver:

Kon J. Gait Generation for Damaged Hexapods using Genetic Algorithm. [Internet] [Masters thesis]. Rochester Institute of Technology; 2020. [cited 2021 Feb 26]. Available from: https://scholarworks.rit.edu/theses/10393.

Council of Science Editors:

Kon J. Gait Generation for Damaged Hexapods using Genetic Algorithm. [Masters Thesis]. Rochester Institute of Technology; 2020. Available from: https://scholarworks.rit.edu/theses/10393

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations