The Minimization of Public Facilities With Enhanced Genetic Algorithms Using War Elimination
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.
We consider the problem of correlated data gathering by a network with a sink node and a tree based communication structure, where the goal is to minimize the total trans- mission cost of transporting the information collected by the nodes, to the sink nod ...
Combinatorial optimization problems in the real world are ubiquitous. Practical applications include planning, scheduling, distributed control, resource allocation, etc. These problems often involve multiple agents and can be formulated as a Multi-agent Co ...
Currently, Genetic Algorithms (GA) are widely used in different optimization problems. One of the problems with GAs is tuning their parameters correctly as they can have a significant effect on GA's overall performance. Till now, different methods have bee ...
Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2007
A powerful approach for dynamic optimization in the presence of uncertainty is to incorporate measurements into the optimization framework so as to track the necessary conditions of optimality (NCO), the so-called NCO- tracking approach. For nonsingular co ...
This paper studies the interaction between the communication costs in a sensor network and the structure of the data that it measures. We formulate an optimization problem definition for power efficient data gathering and assess its computational difficult ...
Matching Pursuit is a greedy algorithmthat decomposes any signal into a linear expansion of waveforms taken from a redundant dictionary. Computing the projection of the signal on every element of the basis has a high computational cost. To reduce this comp ...
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 have developed a new derivative-free algorithm based on Radial Basis Functions (RBFs). Derivative-free optimization is an active field of research and several algorithms have been proposed recently. Problems of this nature in the industrial setting are ...
We present a new approach that is able to produce an increased fault tolerance in bio-inspired electronic circuits. In order to do so, we designed hardware-friendly genetic regulatory networks based on a bio-inspired hardware architecture called POEtic tis ...
This report presents a new methodological approach for the optimal design of energy integrated batch processes. The main emphasis is put on indirect and, to some extend, on direct heat exchange networks with the possibility of introducing closed or open st ...
