Relative Efficiency of Stochastic and Genetic Algorithms for Characterizing Clusters with Unique Bonding Patterns
Related publications (54)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
This paper describes new optimization strategies that offer significant improvements in performance over existing methods for bridge-truss design. In this study, a real-world cost function that consists of costs on the weight of the truss and the number of ...
Synthetic yet realistic images are valuable for many applications in visual sciences and medical imaging. Typically, investigators develop algorithms and adjust their parameters to generate images that are visually similar to real images. In this study, we ...
System-level design decisions such as HW/SW partitioning, target architecture selection and scheduler selection are some of the main concerns of current complex system-on-chip (SOC) designs. In this paper, a novel window-based heuristic is proposed that ad ...
An assembly line is a production line in which units move continuously through a sequence of stations. The assembly line balancing problem is defined as the allocation of tasks to an ordered sequence of stations subject to precedence constraints with the o ...
In this article, we propose a novel partitioning method for hardware-software codesign based on a genetic algorithm that has been enhanced for this specific task. Given a high- level program and an area constraint, our software considers different granular ...
We explore using particle swarm optimization on problems with noisy performance evaluation, focusing on unsupervised robotic learning. We adapt a technique of overcoming noise used in genetic algorithms for use with particle swarm optimization, and evaluat ...
Discrete optimization is a difficult task common to many different areas in modern research. This type of optimization refers to problems where solution elements can assume one of several discrete values. The most basic form of discrete optimization is bin ...
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program's evaluation profile with respect to a set of fitness cases and constraining to a spec ...
In high head dams, the kinetic energy at the spillway toe is very high and the tail-water depth available for energy dissipation is relatively small. Cascade stilling basins are energy dissipation systems for high head dams, the design of which is based on ...
This paper focuses on the scheduling problem of minimizing makespan for a given set of jobs in a two-stage hybrid flowshop subject to a product-mix ratio constraint. There are identical parallel machines at the first stage of the hybrid flowshop, while the ...