default search action
Philippe Collard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j17]Philippe Collard:
Processionary Caterpillars at the Edge of Complexity. Artif. Life 30(2): 171-192 (2024) - 2022
- [j16]Philippe Collard
:
The "flat peer learning" agent-based model. J. Comput. Soc. Sci. 5(1): 161-187 (2022) - 2020
- [j15]Philippe Collard
From selfishness & Altruism to Macro-Behavior. Adv. Complex Syst. 23(7): 2050016:1-2050016:22 (2020) - [j14]Philippe Collard
Second-order micromotives and macrobehaviour. J. Comput. Soc. Sci. 3(1): 209-229 (2020) - [c66]Philippe Collard:
Micro-motivations du Second Ordre : application à la ségrégation spatiale. JFSMA 2020
2010 – 2019
- 2019
- [j13]Philippe Collard:
Strong and Weak Spatial Segregation with Multilevel Discrimination Criteria. Complex Syst. 28(2) (2019) - [j12]Philippe Collard:
λCA : A Peer Learning Cellular Automaton. J. Cell. Autom. 14(3-4): 263-288 (2019) - 2017
- [j11]Philippe Collard:
The "Two's Company, Three's a Crowd" Game. Complex Syst. 26(3) (2017) - [c65]Laurent Brisson
Information Dissemination in Scale-Free Networks: Profusion Versus Scarcity. COMPLEX NETWORKS 2017: 909-920 - 2016
- [j10]Philippe Collard, Teodor Ghetiu:
Segregation Landscape: A New View on the Schelling Segregation Space. Complex Syst. 25(3) (2016) - 2015
- [c64]Martine Collard, Philippe Collard, Laurent Brisson
Rumor Spreading Modeling: Profusion versus Scarcity. ASONAM 2015: 1547-1554 - 2014
- [c63]Philippe Collard, Wilfried Segretier:
How can imitation counterbalance innovation? An ABM Bass model for competing products. RCIS 2014: 1-2 - 2013
- [j9]Philippe Collard, Salma Mesmoudi, Teodor Ghetiu, Fiona Polack:
Emergence of Frontiers in Networked Schelling Segregationist Models. Complex Syst. 22(1) (2013) - [c62]Martine Collard, Philippe Collard, Erick Stattner:
Simulating human mobility and information diffusion. ASONAM 2013: 197-201 - [c61]Philippe Collard:
Beyond the schelling's segregation: is it equivalent to be repulsed by dissimilar rather to be attracted by similar? ECAL 2013: 480-487 - 2012
- [j8]Leonardo Vanneschi
A study of the neutrality of Boolean function landscapes in genetic programming. Theor. Comput. Sci. 425: 34-57 (2012) - [c60]Martine Collard, Philippe Collard, Erick Stattner:
Mobility and Information Flow: Percolation in a Multi-Agent Model. ANT/MobiWIS 2012: 22-29 - 2011
- [c59]Philippe Collard, Salma Mesmoudi:
How to prevent intolerant agents from high segregation? ECAL 2011: 168-175 - [i17]David Simoncini, Sébastien Vérel, Philippe Collard, Manuel Clergue:
Centric selection: a way to tune the exploration/exploitation trade-off. CoRR abs/1107.4163 (2011) - [i16]Leonardo Vanneschi, Sébastien Vérel, Philippe Collard, Marco Tomassini:
NK landscapes difficulty and Negative Slope Coefficient: How Sampling Influences the Results. CoRR abs/1107.4164 (2011)
2000 – 2009
- 2009
- [c58]Leonardo Vanneschi
NK Landscapes Difficulty and Negative Slope Coefficient: How Sampling Influences the Results. EvoWorkshops 2009: 645-654 - [c57]David Simoncini, Sébastien Vérel
Centric selection: a way to tune the exploration/exploitation trade-off. GECCO 2009: 891-898 - [c56]Maroun Bercachi, Philippe Collard, Manuel Clergue
Do not choose representation just change: an experimental study in states based EA. GECCO 2009: 1799-1800 - [i15]William Beaudoin, Sébastien Vérel, Philippe Collard, Cathy Escazut:
Deceptiveness and Neutrality - the ND family of fitness landscapes. CoRR abs/0901.3769 (2009) - [i14]Maroun Bercachi, Philippe Collard, Manuel Clergue, Sébastien Vérel:
Do not Choose Representation just Change: An Experimental Study in States based EA. CoRR abs/0905.2882 (2009) - 2008
- [p1]Maroun Bercachi, Philippe Collard, Manuel Clergue
Studying the Effects of Dual Coding on the Adaptation of Representation for Linkage in Evolutionary Algorithms. Linkage in Evolutionary Computation 2008: 249-284 - [i13]David Simoncini, Sébastien Vérel, Philippe Collard, Manuel Clergue:
Anisotropic selection in cellular genetic algorithms. CoRR abs/0802.2429 (2008) - [i12]Denis Pallez, Philippe Collard, Thierry Baccino, Laurent Dumercy:
Eye-Tracking Evolutionary Algorithm to minimize user's fatigue in IEC applied to Interactive One-Max problem. CoRR abs/0803.3192 (2008) - [i11]Sébastien Vérel, Philippe Collard, Marco Tomassini, Leonardo Vanneschi:
Neutral Fitness Landscape in the Cellular Automata Majority Problem. CoRR abs/0803.4240 (2008) - [i10]Maroun Bercachi, Philippe Collard, Manuel Clergue, Sébastien Vérel:
Evolving Dynamic Change and Exchange of Genotype Encoding in Genetic Algorithms for Difficult Optimization Problems. CoRR abs/0803.4241 (2008) - [i9]David Simoncini, Philippe Collard, Sébastien Vérel, Manuel Clergue:
From Cells to Islands: An unified Model of Cellular Parallel Genetic Algorithms. CoRR abs/0803.4248 (2008) - [i8]David Simoncini, Philippe Collard, Sébastien Vérel, Manuel Clergue:
On the Influence of Selection Operators on Performances in Cellular Genetic Algorithms. CoRR abs/0804.0852 (2008) - 2007
- [j7]Sébastien Vérel
Fitness landscape of the cellular automata majority problem: View from the "Olympus". Theor. Comput. Sci. 378(1): 54-77 (2007) - [c55]Maroun Bercachi, Philippe Collard, Manuel Clergue
Evolving dynamic change and exchange of genotype encoding in genetic algorithms for difficult optimization problems. IEEE Congress on Evolutionary Computation 2007: 4516-4523 - [c54]David Simoncini, Philippe Collard, Sébastien Vérel
On the influence of selection operators on performances in cellular Genetic Algorithms. IEEE Congress on Evolutionary Computation 2007: 4706-4713 - [c53]Leonardo Vanneschi
A Comprehensive View of Fitness Landscapes with Neutrality and Fitness Clouds. EuroGP 2007: 241-250 - [c52]Denis Pallez
Eye-tracking evolutionary algorithm to minimize user fatigue in IEC applied to interactive one-max problem. GECCO (Companion) 2007: 2883-2886 - [i7]Michael Defoin-Platel, Sébastien Vérel, Manuel Clergue, Philippe Collard:
From Royal Road to Epistatic Road for Variable Length Evolution Algorithm. CoRR abs/0707.0548 (2007) - [i6]Sébastien Vérel, Philippe Collard, Manuel Clergue:
Where are Bottlenecks in NK Fitness Landscapes? CoRR abs/0707.0641 (2007) - [i5]Sébastien Vérel
Scuba Search : when selection meets innovation. CoRR abs/0707.0643 (2007) - [i4]Philippe Collard, Sébastien Vérel
How to use the Scuba Diving metaphor to solve problem with neutrality ? CoRR abs/0707.0652 (2007) - [i3]Sébastien Vérel, Philippe Collard, Marco Tomassini, Leonardo Vanneschi:
Fitness landscape of the cellular automata majority problem: View from the Olympus. CoRR abs/0709.3974 (2007) - [i2]Philippe Collard, Sébastien Vérel
Local search heuristics: Fitness Cloud versus Fitness Landscape. CoRR abs/0709.4010 (2007) - [i1]Sébastien Vérel
Measuring the Evolvability Landscape to study Neutrality. CoRR abs/0709.4011 (2007) - 2006
- [j6]Sébastien Vérel, Philippe Collard, Manuel Clergue
Neutralité dans les paysages de fitness. Évolution artificielle et neutralité. Tech. Sci. Informatiques 25(8-9): 1023-1048 (2006) - [c51]David Simoncini, Philippe Collard, Sébastien Vérel, Manuel Clergue:
From Cells to Islands: An Unified Model of Cellular Parallel Genetic Algorithms. ACRI 2006: 248-257 - [c50]Sébastien Vérel, Philippe Collard, Marco Tomassini, Leonardo Vanneschi
Neutral Fitness Landscape in the Cellular Automata Majority Problem. ACRI 2006: 258-267 - [c49]Leonardo Vanneschi
Negative Slope Coefficient: A Measure to Characterize Genetic Programming Fitness Landscapes. EuroGP 2006: 178-189 - [c48]William Beaudoin, Sébastien Vérel, Philippe Collard, Cathy Escazut:
Deceptiveness and neutrality the ND family of fitness landscapes. GECCO 2006: 507-514 - [c47]David Simoncini, Sébastien Vérel, Philippe Collard, Manuel Clergue:
Anisotropic selection in cellular genetic algorithms. GECCO 2006: 559-566 - [c46]Sébastien Vérel, Philippe Collard, Manuel Clergue:
Measuring the evolvability landscape to study neutrality. GECCO 2006: 613-614 - [c45]Leonardo Vanneschi, Yuri Pirola, Philippe Collard:
A quantitative study of neutrality in GP boolean landscapes. GECCO 2006: 895-902 - 2005
- [j5]Marco Tomassini, Leonardo Vanneschi
A Study of Fitness Distance Correlation as a Difficulty Measure in Genetic Programming. Evol. Comput. 13(2): 213-239 (2005) - [c44]Michael Defoin-Platel, Manuel Clergue, Philippe Collard:
Size Control with Maximum Homologous Crossover. Artificial Evolution 2005: 13-24 - [c43]Leonardo Vanneschi
A Survey of Problem Difficulty in Genetic Programming. AI*IA 2005: 66-77 - [c42]Michael Defoin-Platel, Malik Chami, Manuel Clergue, Philippe Collard:
Teams of Genetic Predictors for Inverse Problem Solving. EuroGP 2005: 341-350 - 2004
- [c41]Sébastien Vérel
Scuba search: when selection meets innovation. IEEE Congress on Evolutionary Computation 2004: 924-931 - [c40]Philippe Collard, Sébastien Vérel, Manuel Clergue:
How to Use the Scuba Diving Metaphor to Solve Problems with Neutrality? ECAI 2004: 166-170 - [c39]Philippe Collard, Sébastien Vérel, Manuel Clergue:
Local Search Heuristics: Fitness Cloud versus Fitness Landscape. ECAI 2004: 973-974 - [c38]Michael Defoin-Platel, Manuel Clergue, Philippe Collard:
Dynamical Teams of Genetic Predictors. ECAI 2004: 989-990 - [c37]Leonardo Vanneschi
Fitness Clouds and Problem Hardness in Genetic Programming. GECCO (2) 2004: 690-701 - 2003
- [c36]Michael Defoin-Platel, Sébastien Vérel, Manuel Clergue, Philippe Collard:
From Royal Road to Epistatic Road for Variable Length Evolution Algorithm. Artificial Evolution 2003: 3-14 - [c35]Sébastien Vérel
Where are bottlenecks in NK fitness landscapes? IEEE Congress on Evolutionary Computation 2003: 273-280 - [c34]Michael Defoin-Platel, Manuel Clergue
Homology gives size control in genetic programming. IEEE Congress on Evolutionary Computation 2003: 281-288 - [c33]Leonardo Vanneschi
Fitness distance correlation in genetic programming: a constructive counterexample. IEEE Congress on Evolutionary Computation 2003: 289-296 - [c32]Michael Defoin-Platel, Manuel Clergue, Philippe Collard:
Maximum Homologous Crossover for Linear Genetic Programming. EuroGP 2003: 194-203 - [c31]Leonardo Vanneschi
Fitness Distance Correlation in Structural Mutation Genetic Programming. EuroGP 2003: 455-464 - [c30]Leonardo Vanneschi
Difficulty of Unimodal and Multimodal Landscapes in Genetic Programming. GECCO 2003: 1788-1799 - 2002
- [j4]Philippe Collard, Jean-Claude Mangin, Gilbert Achard:
Criteria and Preferences Modelling. J. Decis. Syst. 11(3-4): 459-477 (2002) - [c29]Manuel Clergue
GA-hard functions built by combination of Trap functions. IEEE Congress on Evolutionary Computation 2002: 249-254 - [c28]Manuel Clergue, Philippe Collard, Marco Tomassini, Leonardo Vanneschi:
Fitness Distance Correlation And Problem Difficulty For Genetic Programming. GECCO 2002: 724-732 - 2000
- [j3]Philippe Collard, Manuel Clergue:
Genetic Algorithms: From Hegemony to Chaos. Complex Syst. 12(1) (2000) - [c27]Philippe Collard, Manuel Clergue, Francis Bonnin:
Misleading functions designed from alternation. CEC 2000: 1056-1063 - [c26]Alessio Gaspar, Philippe Collard:
Two models of immunization for time dependent optimization. SMC 2000: 113-118
1990 – 1999
- 1999
- [c25]Philippe Collard, Manuel Clergue, Michael Defoin-Platel:
Synthetic Neutrality for Artificial Evolution. Artificial Evolution 1999: 254-265 - [c24]Alessio Gaspar, Philippe Collard:
From GAs to artificial immune systems: improving adaptation in time dependent optimization. CEC 1999: 1859-1866 - [c23]Alessio Gaspar, Philippe Collard:
There is ALife beyond convergence: using a dual sharing to adapt in time dependent optimization. CEC 1999: 1867-1874 - [c22]Manuel Clergue, Philippe Collard:
Genetic Heuristic for Search Space Exploration. IJCAI 1999: 1218-1226 - 1998
- [c21]Philippe Collard, Alessio Gaspar, Manuel Clergue, Cathy Escazut:
Fitness Distance Correlation, as statistical measure of Genetic Algorithm difficulty, revisited. ECAI 1998: 650-654 - 1997
- [j2]Olivier Michel, Manuel Clergue
Artificial Neurogenesis: Applications to the Cart-Pole Problem and to an Autonomous Mobile Robot. Int. J. Artif. Intell. Tools 6(4): 613-634 (1997) - [j1]Philippe Collard, Cathy Escazut, Alessio Gaspar:
An Evolutionary Approach for Time Dependent Optimization. Int. J. Artif. Intell. Tools 6(4): 665-695 (1997) - [c20]Cathy Escazut, Philippe Collard:
Genetic Algorithms at the Edge of a Dream. Artificial Evolution 1997: 69-80 - [c19]Manuel Clergue, Philippe Collard:
Dual Genetic Algorithms and Pareto Optimization. ICANNGA 1997: 188-192 - [c18]Jean-Luc Ségapeli, Cathy Escazut, Philippe Collard:
DGP: How To Improve Genetic Programming with Duals. ICANNGA 1997: 409-413 - [c17]Alessio Gaspar, Philippe Collard:
Time Dependent Optimization with a Folding Genetic Algorithm. ICTAI 1997: 125-132 - 1996
- [c16]Philippe Collard, Alessio Gaspar:
'Royal-Road' Landscapes for a Dual Genetic Algorithm. ECAI 1996: 213-217 - [c15]Philippe Collard, Cathy Escazut:
Fitness Distance Correlation in a Dual Genetic Algorithm. ECAI 1996: 218-222 - [c14]Philippe Collard, Cathy Escazut, Alessio Gaspar:
An Evolutionary Approach for Time Dependent Optimization. ICTAI 1996: 2-9 - [c13]Olivier Michel, Philippe Collard:
Artificial Neurogenesis: An Application to Autonomous Robotics. ICTAI 1996: 207-214 - [c12]Philippe Collard, Cathy Escazut, Alessio Gaspar:
Genetic Algorithms and Relational Landscapes. PPSN 1996: 472-481 - 1995
- [c11]Cathy Escazut, Philippe Collard:
Learning Disjunctive Normal Forms in a Dual Classifier System (Extended Abstract). ECML 1995: 271-274 - [c10]Philippe Collard, Cathy Escazut:
DCS: A Promising Classifier System. ICANNGA 1995: 14-17 - [c9]Cathy Escazut, Philippe Collard:
Typology of Boolean Functions Using Walsh Analysis. ICANNGA 1995: 160-163 - [c8]Philippe Collard, Cathy Escazut:
Relational Schemata: A Way to Improve the Expressiveness of Classifiers. ICGA 1995: 397-404 - [c7]Philippe Collard, Cathy Escazut:
Genetic operators in a dual genetic algorithm. ICTAI 1995: 12-19 - 1994
- [c6]Philippe Collard, Jean-Philippe Aurand:
DGA: An Efficient Genetic Algorithm. ECAI 1994: 487-492 - [c5]Philippe Collard, Jean-Luc Ségapeli:
Using a Double-based Genetic Algorithm on a Population of Computer Programs. ICTAI 1994: 418-424 - 1992
- [c4]Steven Deller, Philippe Collard, Anthony B. Gargaro, Stephen F. Zeigler, Thomas H. Probert:
Panel: Ada and high performance computing - reality or myth? WADAS 1992: 124-128 - 1991
- [c3]Andre Goforth, Philippe Collard, Matthew Marquardt:
Parallel programming in Ada: experience and results. Compcon 1991: 413-419 - 1990
- [c2]Philippe Collard, Andre Goforth, Matthew Marquardt:
Ada as a parallel language for high performance computers: experience and results. TRI-Ada 1990: 346-351 - [c1]Andre Goforth, Philippe Collard, Matthew Marquardt:
Performance measurement of parallel Ada: an applications based approach. Working Group on Ada Performance Issues 1990: 38-58
1980 – 1989
- 1989
- [d1]Philippe Collard:
Cloud. UCI Machine Learning Repository, 1989
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-24 21:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: