Search results for "Evolutionary algorithm"
showing 10 items of 119 documents
Decision Making in Evolving Artificial Systems
2001
The theme of this workshop is artificial perception. In this chapter we will argue that the ecological function of perception is to serve decision-making. If this is so the mechanisms chosen to implement perception, in natural or artificial systems, will be constrained by the requirements of decision-making and theories of decision-making will inevitably influence theories of perception. In what follows we will look at decision-making from what we hope is a new perspective, applying concepts and techniques developed by what we will call “new artificial intelligence”. We will begin, in the second part of the chapter, with a review of traditional, “normative” theories of decision-making and o…
The node-depth encoding
2008
The node-depth encoding has elements from direct and indirect encoding for trees which encodes trees by storing the depth of nodes in a list. Node-depth encoding applies specific search operators that is a typical characteristic for direct encodings. An investigation into the bias of the initialization process and the mutation operators of the node-depth encoding shows that the initialization process has a bias to solutions with small depths and diameters, and a bias towards stars. This investigation, also, shows that the mutation operators are unbiased. The performance of node-depth encoding is investigated for the bounded-diameter minimum spanning tree problem. The results are presented f…
Orientation matters
2008
The optimal communication spanning tree (OCST) problem is a well known $\mathcal{NP}$-hard combinatorial optimization problem which seeks a spanning tree that satisfies all given communication requirements for minimal total costs. It has been shown that optimal solutions of OCST problems are biased towards the much simpler minimum spanning tree (MST) problem. Therefore, problem-specific representations for EAs like heuristic variants of edge-sets that are biased towards MSTs show high performance.In this paper, additional properties of optimal solutions for Euclidean variants of OCST problems are studied. Experimental results show that not only edges in optimal trees are biased towards low-…
A grid representation for distributed virtual environments
2004
Fast Internet connections and the widespread use of high performance graphic cards are making Distributed Virtual Environments (DVE) very common nowadays. The architecture and behavior of these systems are very similar to new grid computing applications where concepts such as sharing and high scalability are extremely exploited. However, there are several key issues in these systems that should still be improved in order to design a scalable and cost-effective DVE system. One of these key issues is the partitioning problem. This problem consists of efficiently assigning clients (3-D avatars) to the arbiters (servers) in the system. As an alternative to the ad-hoc heuristic proposed in the l…
Automatic fitting of cochlear implants with evolutionary algorithms
2004
This paper presents an optimisation algorithm designed to perform in-situ automatic fitting of cochlear implants.All patients are different, which means that cochlear parametrisation is a difficult and long task, with results ranging from perfect blind speech recognition to patients who cannot make anything out of their implant and just turn it off.The proposed method combines evolutionary algorithms and medical expertise to achieve autonomous interactive fitting through a Personal Digital Assistant (PDA).
Direct 3D Information Determination in an Uncalibrated Stereovision System by Using Evolutionary Algorithms
2011
This paper proposes a 3D panoramic shape reconstruction method based on an uncalibrated stereovision system (USS) composed of five cameras circularly located around the object to be analysed. First, some interesting points are detected from markers placed on the object such that they are visible by two successive cameras of the USS. These points are then matched on both images acquired by a couple of successive cameras. This process is repeated for all the couples of cameras. Second, by using an evolutionary algorithm, the depth values of the different interesting points are calculated. A comparison with a traditional method based on calibrated cameras validates the accuracy of 3D informati…
Using interactive evolutionary algorithms to help fit cochlear implants
2010
An evolutionary method for complex-process optimization
2010
10 páginas, 7 figuras, 7 tablas
Disturbed Exploitation compact Differential Evolution for Limited Memory Optimization Problems
2011
This paper proposes a novel and unconventional Memetic Computing approach for solving continuous optimization problems characterized by memory limitations. The proposed algorithm, unlike employing an explorative evolutionary framework and a set of local search algorithms, employs multiple exploitative search within the main framework and performs a multiple step global search by means of a randomized perturbation of the virtual population corresponding to a periodical randomization of the search for the exploitative operators. The proposed Memetic Computing approach is based on a populationless (compact) evolutionary framework which, instead of processing a population of solutions, handles …
EXAFS study of the local structure of crystalline and nanocrystalline Y2O3using evolutionary algorithm method
2015
Temperature-dependent local structure and lattice dynamics of yttria (Y2O3) were studied by X-ray absorption spectroscopy. Novel method, which combines the reverse Monte Carlo and evolutionary algorithm techniques, was applied for the analysis of extended X-ray absorption fine structure at the Y K-edge. This approach allowed us to reconstruct 3D atomic structure models of crystalline and nanocrystalline Y2O3.