WorldCat Identities

Fonlupt, Cyril

Overview
Works: 36 works in 57 publications in 3 languages and 568 library holdings
Genres: Conference papers and proceedings 
Roles: Editor, Author, htt, Other, Thesis advisor, Opponent
Publication Timeline
.
Most widely held works by Cyril Fonlupt
Artificial evolution : 4th European conference, AE '99, Dunkerque, France, November 3-5, 1999 : selected papers by Gerhard Goos( )

13 editions published in 2000 in English and German and held by 387 WorldCat member libraries worldwide

The Arti?cial Evolution conference was originally conceived as a forum for the French-speaking Evolutionary Computation community, but has of late been acquiring an European audience, with several papers from Germany, Austria, Italy, Spain... However, AE remains as intended a small and friendly gathering, which will continue to be held every two years. Previous AE meets were held in Toulouse, Brest, and Nˆ ?mes. This year, the hosting was done by the LIL (Laboratoire d'Informatique du Littoral) in the not-so-cold city of Dunkerque. The invited talk on "Fitness Landscapes and Evolutionary Algorithms" was delivered by Colin Reeves of Coventry University This volume contains a selection of the papers presented at the conference. Twenty-seven papers were presented orally at the conference, selected from over 40 papers refereed by the program committee. After the conference, each p- sentation was reviewed and 20 papers were retained and revised for publication in this volume. The papers in this volume have been grouped into the following ?ve sections which more or less re?ect the organization of the oral presentations. 1. Invited Paper: C. Reeves brightly describes the state of the art in Fitness Landscapes
Artificial evolution : 5th international conference, Evolution Artificielle, EA 2001, Le Creusot, France, October 29-31, 2001 : selected papers by Pierre Collet( )

3 editions published in 2002 in English and held by 49 WorldCat member libraries worldwide

"This book constitutes the thoroughly refereed post-proceedings of the 5th International Conference on Artificial Evolution, EA 2001, held in Le Creusot, France, in October 2001. The 28 revised full papers presented together with an invited paper were carefully selected and improved during two rounds of reviewing and revision. The papers are organized in topical sections on theoretical issues, algorithmic issues, applications, implementation issues, genetic programming, constraint handling, and co-evolution and agent systems"--Publisher's description
Artificial Evolution : 6th International Conference, Evolution Artificielle, EA 2003, Marseilles, France, October 27-30, 2003, Revised Selected Papers by Pierre Liardet( )

1 edition published in 2004 in English and held by 22 WorldCat member libraries worldwide

Artificial Evolution : 4th European Conference, AE'99, Dunkerque, France, November 3-5, 1999. Selected Papers by Cyril Fonlupt( )

1 edition published in 2000 in English and held by 22 WorldCat member libraries worldwide

Artificial evolution 4th European conference ; selected papers( Book )

2 editions published in 2000 in English and held by 19 WorldCat member libraries worldwide

Artificial Evolution : 6th International Conference, Evolution Artificielle, EA 2003, Marseilles, France, October 27-30, 2003, Revised Selected Papers by Pierre Liardet( )

1 edition published in 2004 in English and held by 18 WorldCat member libraries worldwide

Artificial evolution : 6th International Conference, Evolution Artificielle, EA 2003, Marseille, France, October 27-30, 2003 : revised selected papers by J.-K Hao( )

2 editions published in 2004 in English and held by 11 WorldCat member libraries worldwide

This book constitutes the thoroughly refereed post-conference proceedings of the 8th International Conference on Artificial Evolution, EA 2007, held in Tours, France in October 2007. The 27 revised full papers presented were carefully reviewed and selected from 62 submissions during two rounds of reviewing and improvement. The papers cover all aspects of artificial evolution: genetic programming, swarm intelligence, combinatorial and multi-objective optimization, theory in genetic algorithms and evolutionary systems, as well as applications of evolutionary algorithms
Continuous Schemes for Program Evolution by Cyril Fonlupt( )

2 editions published in 2012 in English and held by 4 WorldCat member libraries worldwide

Continuous Schemes for Program Evolution
Artificial evolution by J.-K Hao( )

2 editions published between 2000 and 2004 in English and held by 3 WorldCat member libraries worldwide

This book constitutes the thoroughly refereed post-conference proceedings of the 13th International Conference on Artificial Evolution, EA 2017, held in Paris, France, in October 2017. The 16 revised papers were carefully reviewed and selected from 33 submissions. The papers cover a wide range of topics in the field of artificial evolution, such as evolutionary computation, evolutionary optimization, co-evolution, artificial life, population dynamics, theory, algorithmics and modeling, implementations, application of evolutionary paradigms to the real world (industry, biosciences ...), other biologically-inspired paradigms (swarm, artificial ants, artificial immune systems, cultural algorithms ...), memetic algorithms, multi-objective optimisation, constraint handling, parallel algorithms, dynamic optimization, machine learning and hybridization with other soft computing techniques
Evolution artificielle 2003 - EA'03 : proceedings by International Conference on Artificial Evolution( Book )

1 edition published in 2003 in English and held by 2 WorldCat member libraries worldwide

Optimisation numérique appliquée à la gestion de crise : Approche basée sur un algorithme hybride pour la résolution du problème intégré d'ordonnancement et d'allocation des ressources. by Mohamad Khorbatly( )

2 editions published in 2018 in English and held by 2 WorldCat member libraries worldwide

The work presented in this thesis is part of human evacuation methods. It aims to study the capacities, model the evacuation problem (wounded, victims, children, elderly, etc.) in a crisis situation (terrorist attacks, natural disasters, etc.) and to develops methods for decision making while proposing better planning and optimal evacuation plans for populations from the crisis zone to hospitals.Our job is to solve the wounded evacuation problem in crisis zone with a new vision that optimizes the transport time and thus saving the maximum of causalities in a dynamic, efficient and fast way in order to minimize human loss
Algorithmes bio-mimétiques pour la reconnaissance de formes et l'apprentissage by Marc Segond( Book )

2 editions published in 2006 in French and held by 2 WorldCat member libraries worldwide

Dans cette thèse, nous appliquons deux algorithmes bio-mimétiques à la résolution d'un problème de biologie marine : la détection de structures rétentives en eaux côtières. Nous confrontons ces deux méthodes, à savoir un algorithme à colonies de fourmis et la programmation génétique, avec des méthodes dites « classiques » (analyse physique, streamlines...) et mettons en évidence les difficultés de ces dernières à traiter ce problème, rendu difficile par la proximité des côtes induisant de fortes perturbations de courant. Pour pallier ce problème, nous proposons tout d'abord une adaptation de l'algorithme à colonies de fourmis tel que défini par Marco Dorigo, introduisant les notions de biais, de multiples colonies et d'évaporation instantanée de la phéromone. Cette méthode se révèle performante et ses détections sont d'une qualité satisfaisant les exigences des biologistes. Nous proposons ensuite une adaptation de la programmation génétique inspirée des travaux de Jason Daida sur la détection de crêtes de pressions sur la croûte glaciaire. Nous introduisons le concept de génération de filtres itératifs, technique permettant la prise en compte et la propagation d'informations globales. Cette méthode se révèle, elle aussi performante, mais n'est pas directement utilisable car elle ne permet pas d'identifier les enveloppes des structures rétentives. Elle met plutôt en évidence des zones rétentives
Advanced methods to solve the maximum parsimony problem by Karla Esmeralda Vazquez ortiz( )

1 edition published in 2016 in English and held by 2 WorldCat member libraries worldwide

La reconstruction phylogénétique est considérée comme un élément central de divers domaines comme l'écologie, la biologie et la physiologie moléculaire pour lesquels les relations généalogiques entre séquences d'espèces ou de gènes, représentées sous forme d'arbres, peuvent apporter des éclairages significatifs à la compréhension de phénomènes biologiques. Le problème de Maximum de Parcimonie est une approche importante pour résoudre la reconstruction phylogénétique en se basant sur un critère d'optimalité pour lequel l'arbre comprenant le moins de mutations est préféré. Dans cette thèse nous proposons différentes méthodes pour s'attaquer à la nature combinatoire de ce problème NP-complet. Premièrement, nous présentons un algorithme de Recuit Simulé compétitif qui nous a permis de trouver des solutions de meilleure qualité pour un ensemble de problèmes. Deuxièmement, nous proposons une nouvelle technique de Path-Relinking qui semble intéressante pour comparer des arbres mais pas pour trouver des solutions de meilleure qualité. Troisièmement, nous donnons le code d'une implantation sur GPU de la fonction objectif dont l'intérêt est de réduire le temps d'exécution de la recherche pour des instances dont la longueur des séquences est importante. Finalement, nous introduisons un prédicteur capable d'estimer le score optimum pour un vaste ensemble d'instances avec une très grande précision
Développement d'un paradigme d'optimisation par Hommilière et application à l'enseignement assisté par ordinateur sur Internet by Grégory Valigiani( Book )

2 editions published in 2006 in French and held by 2 WorldCat member libraries worldwide

This thesis describes the implementation of an Intelligent Tutoring System (ITS) within the existing e-learning software of the Paraschool company, in order to help students to find their way among thousands of different items. The system is operationnal, and the different versions have been tested for real on more than 250 000 users that use the site over the Internet. The man-hill optimization technique described in this document stems from a first attempt to use an Ant Colony Optimisation (ACO) algorithm, which revealed unsuited for the task. To the opposite of artificial ants, human students are not controllable : it is not possible to count on innate altruism, their activity is variable (holidays), each students needs a specific treatment,...All in all, the modifications that needed to be applied to the ACO paradigm were so numerous that it became obvious that the collective use of human students for optimization was indeed a different paradigm that we called "man-hill optimization". This thesis also contains a contribution to the automatic rating of students and items (exercises) based on the ELO chess rating system. Beyond being a powerful tool for suggesting good exercices, the system showed that it is also very powerful to make sure the e-learning software works well, as it is capable of finding exercices that contain not only syntaxic, but also semantic errors. the system can also point out exercices that are not well placed in the pedagogic progression. Finally, all web sites browsed by many users can benefit from this technique to optimize their contents, their structure and make sure that all is going well
Génération d'algorithmes de recherche locale by Vincent Hénaux( )

1 edition published in 2021 in French and held by 2 WorldCat member libraries worldwide

Solving an optimization problem is about finding the best possible solutions. To achieve this, a common approach is to use specific algorithms, usually designed for specific classes of problems. However, this approach suffers from two disadvantages. First with each new type of problem, a new algorithm often has to be defined, which is a lengthy process, requiring knowledge of the prop- erties of the problem in question. Then, if these algorithms are only tested on certain instances of the problem, it is possible that they turn out to be too specific and therefore ultimately less efficient on all the instances of the class. In this thesis work, we explore the possibility of automatically generating optimization algorithms for a given problem. The generation process remains sufficiently generic while the algorithms thus produced can be very specific in order to be as efficient as possible. More precisely, we develop simple neighborhood search algorithms via the evaluation functions that they use to explore the problem solution space. The evolutionary process implicitly makes it possible to adapt the search landscape to the basic solution strategy, while maintaining consistency with the initial objective function of the problem to be solved. This generation process is tested on two classes of problems whose difficulties are very different, and obtains encouraging results. This experiment is completed by an analysis of the generation process and of the algorithms thus generated
Evolution artificielle - EA 2003 : proceedings by International Conference on Artificial Evolution. EA( Book )

1 edition published in 2003 in French and held by 1 WorldCat member library worldwide

Modélisation de formes 3D par les graphes pour leur reconnaissance : application à la vision 3D en robotique dans des tâches de "Pick-and-Place by Pierre Willaume( )

1 edition published in 2017 in French and held by 1 WorldCat member library worldwide

L'objectif de cette thèse est de concevoir un système automatique constitué d'une ou plusieurs caméras capables de détecter en trois dimensions un amalgame d'objets stockés dans un conteneur. Pour ceci, il est nécessaire de modéliser, de reconnaître et de localiser des formes dans une image. Dans un premier temps, Nous proposons une solution d'optimisation du calibrage de caméras. C'est une tâche essentielle pour récupérer des informations quantitatives sur les images capturées. Cette méthode nécessite des compétences spécifiques en matière de traitement d'image, ce qui n'est pas toujours le cas dans l'industrie. Nous proposons d'automatiser et d'optimiser le système d'étalonnage en éliminant la sélection des images par l'opérateur. Ensuite, nous proposons d'améliorer les systèmes de détection d'objets fins et sans motif. Enfin, nous proposons d'adapter des algorithmes évolutionnaires dans le but d'optimiser les temps de recherche
Multi-objective optimization of dial a ride problems : modeling and resolution by Manel Ayadi( )

1 edition published in 2015 in English and held by 1 WorldCat member library worldwide

This thesis focuses on finding computer science solutions for some combinatorial optimization problems, namely Vehicle Routing Problems (VRP). The thesis addresses the Dial A Ride Problems (DARP). Its main objective is to use some exact and meta-heuristics approaches to solve multi-objective optimization of Dial A Ride Problem with multi-vehicles. Hence, our main research aims are : - I)Solve a multi-objective Dial A Ride Problem with multi-vehicles based on quality of service, this problem treats a general case ; - II) Solve another multi-objective Dial A Ride Problem with multi-vehicles, this problem deals with a specific case which is an application of the Dial A Ride Problem in Home Health Care (HHC). We have also applied exact algorithms "Branch and Bound" and meta-heuristic algorithms such as evolutionary algorithms "Genetic Algorithm" and "Ant Colony" algorithm to provide effective solutions to these different problems. A set of numerical results are presented for each of these methods. Our results show that they produce high quality solutions in a reasonable execution time for all the treated problems
La mémoire dans les algorithmes à colonie de fourmis : applications à l'optimisation et à la programmation automatique by Olivier Roux( )

1 edition published in 2001 in French and held by 1 WorldCat member library worldwide

This thesis presents meta-heuristic based on the behaviour of natural ants looking for food. These heuristics are known as Ants Colony Optimization or ACO. We propose to compare the ACO paradigm with other well-known heuristics with regards to the use of the memory. Then, we introduce two applications of the ACO algorithms. The first application, ANTabu is an ACO scheme for the QAP. ANTabu combines the ants' paradigm with a robust local search technique (Tabu search). A parallel model developed for ANTabu is introduced. The second application lies in the machine-learning field. This scheme called AP (Automatic Programming) applies the cooperative behaviour of ants to automatically buid programs. This method is then compared to the classical automatic generation of programs : Genetic Programming
Ontologies et web sémantique pour une construction évolutive d'applications dédiées à la logistique by Hayder Hendi( )

1 edition published in 2017 in English and held by 1 WorldCat member library worldwide

Le domaine de la logistique implique souvent la résolution de problèmes combinatoires complexes. Ces derniers font également implicitement référence à des processus, acteurs, activités et méthodes concernant divers aspects qu'il faut considérer. Ainsi, un même problème peut faire intervenir des processus de vente/achat, transport/livraison et gestion de stock. Ces processus sont tellement divers et interconnectés qu'il est difficile pour un logisticien de tous les maîtriser. Dans cette thèse, nous proposons l'explicitation, par le biais d'ontologies, de connaissances conceptuelles et sémantiques concernant les processus logistiques. Ces connaissances explicites sont alors mises à contribution pour construire un système à base de connaissances permettant de guider les logisticiens dans la construction, de façon incrémentale et semi-automatique, de solutions informatiques à un problème qui leur est posé à un moment donné. Nous mettons en oeuvre une ontologie concernant le domaine de la logistique connectée à une ontologie associée à la problématique de l'optimisation. Nous établissons ainsi un lien sémantique explicite entre le domaine de la logistique et celui de l'optimisation. Cela permet aux logisticiens d'identifier de façon précise et sans ambigüité le problème logistique auquel il est confronté et les problèmes d'optimisation associés. L'identification des problèmes conduit alors à un processus de choix des solutions allant du choix du processus logistique précis à mettre en oeuvre à celui de la méthode de résolution du problème combinatoire et cela jusqu'à la découverte du composant informatique à invoquer et qui est matérialisé par un service web. L'approche que nous avons adoptée et mise en oeuvre a été expérimentée avec les problèmes de routage de véhicules, le problème de transport ferroviaire de passagers et le problème de terminaux de conteneurs
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  General Special  
Audience level: 0.70 (from 0.51 for Artificial ... to 0.95 for Artificial ...)

WorldCat IdentitiesRelated Identities
Artificial evolution : 4th European conference, AE '99, Dunkerque, France, November 3-5, 1999 : selected papers Artificial evolution 4th European conference ; selected papers
Covers
Artificial Evolution : 4th European Conference, AE'99, Dunkerque, France, November 3-5, 1999. Selected PapersArtificial evolution 4th European conference ; selected papersArtificial Evolution : 6th International Conference, Evolution Artificielle, EA 2003, Marseilles, France, October 27-30, 2003, Revised Selected PapersArtificial evolution : 6th International Conference, Evolution Artificielle, EA 2003, Marseille, France, October 27-30, 2003 : revised selected papersArtificial evolution
Languages
English (32)

French (8)

German (1)