default search action
Christine Zarges
Person information
- affiliation: Aberystwyth University, UK
- affiliation: University of Birmingham, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j15]Yumna Zahid
, Christine Zarges
Adversarial diffusion for few-shot scene adaptive video anomaly detection. Neurocomputing 614: 128796 (2025) - 2024
- [c42]Thomas Jansen
Experimental and Theoretical Analysis of Local Search Optimising OBDD Variable Orderings. EvoStar 2024: 177-192 - [i4]Lily Major, Amanda Clare, Jacqueline W. Daykin, Benjamin Mora, Christine Zarges:
Heuristics for the Run-length Encoded Burrows-Wheeler Transform Alphabet Ordering Problem. CoRR abs/2401.16435 (2024) - [i3]Lily Major, Dave Davies, Amanda Clare, Jacqueline W. Daykin, Benjamin Mora, Christine Zarges:
A visualization tool to explore alphabet orderings for the Burrows-Wheeler Transform. CoRR abs/2402.17005 (2024) - 2021
- [j14]Zaineb Chelly Dagdia, Christine Zarges
A Detailed Study of the Distributed Rough Set Based Locality Sensitive Hashing Feature Selection Technique. Fundam. Informaticae 182(2): 111-179 (2021) - [e3]Christine Zarges
Evolutionary Computation in Combinatorial Optimization - 21st European Conference, EvoCOP 2021, Held as Part of EvoStar 2021, Virtual Event, April 7-9, 2021, Proceedings. Lecture Notes in Computer Science 12692, Springer 2021, ISBN 978-3-030-72903-5 [contents] - 2020
- [j13]Zaineb Chelly Dagdia
A scalable and effective rough set theory-based approach for big data pre-processing. Knowl. Inf. Syst. 62(8): 3321-3386 (2020) - [c41]Lily Major
Evaluation of a Permutation-Based Evolutionary Framework for Lyndon Factorizations. PPSN (1) 2020: 390-403 - [p2]Christine Zarges:
Theoretical Foundations of Immune-Inspired Randomized Search Heuristics for Optimization. Theory of Evolutionary Computation 2020: 443-474 - [e2]Luís Paquete
Evolutionary Computation in Combinatorial Optimization - 20th European Conference, EvoCOP 2020, Held as Part of EvoStar 2020, Seville, Spain, April 15-17, 2020, Proceedings. Lecture Notes in Computer Science 12102, Springer 2020, ISBN 978-3-030-43679-7 [contents]
2010 – 2019
- 2019
- [j12]Pietro S. Oliveto
On the benefits and risks of using fitness sharing for multimodal optimisation. Theor. Comput. Sci. 773: 53-70 (2019) - [c40]Jun He, Thomas Jansen
Unlimited budget analysis. GECCO (Companion) 2019: 427-428 - [c39]Amanda Clare
Evolutionary search techniques for the Lyndon factorization of biosequences. GECCO (Companion) 2019: 1543-1550 - [i2]Jun He, Thomas Jansen, Christine Zarges:
Unlimited Budget Analysis of Randomised Search Heuristics. CoRR abs/1909.03342 (2019) - 2018
- [j11]Christine Zarges:
Hod Lipson and Melba Kurman: Driverless: intelligent cars and the road ahead - The MIT Press, 2016, pp 312, ISBN: 9780262035224. Genet. Program. Evolvable Mach. 19(1-2): 301-303 (2018) - [c38]Zaineb Chelly Dagdia
A Distributed Rough Set Theory Algorithm based on Locality Sensitive Hashing for an Efficient Big Data Pre-processing. IEEE BigData 2018: 2597-2606 - [c37]Zaineb Chelly Dagdia, Christine Zarges, Gaël Beck, Mustapha Lebbah:
Nouveau Modèle de Sélection de Caractéristiques basé sur la Théorie des Ensembles Approximatifs pour les Données Massives. EGC 2018: 377-378 - [c36]Ales Zamuda
A black-box discrete optimization benchmarking (BB-DOB) pipeline survey: taxonomy, evaluation, and ranking. GECCO (Companion) 2018: 1777-1782 - [c35]Zaineb Chelly Dagdia
Rough Set Theory as a Data Mining Technique: A Case Study in Epidemiology and Cancer Incidence Prediction. ECML/PKDD (3) 2018: 440-455 - [c34]Thomas Jansen, Christine Zarges:
Theoretical Analysis of Lexicase Selection in Multi-objective Optimization. PPSN (2) 2018: 153-164 - [c33]Robin C. Purshouse, Christine Zarges, Sylvain Cussat-Blanc, Michael G. Epitropakis, Marcus Gallagher, Thomas Jansen, Pascal Kerschke, Xiaodong Li, Fernando G. Lobo
Workshops at PPSN 2018. PPSN (2) 2018: 490-497 - 2017
- [j10]Dogan Corus
On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation. Algorithmica 78(2): 714-740 (2017) - [c32]Zaineb Chelly Dagdia
A distributed rough set theory based algorithm for an efficient big data pre-processing under the spark framework. IEEE BigData 2017: 911-916 - [c31]Ales Zamuda, Christine Zarges
Stability selection using a genetic algorithm and logistic linear regression on healthcare records. GECCO (Companion) 2017: 143-144 - [c30]Andrei Lissovoi, Dirk Sudholt, Markus Wagner
Theoretical results on bet-and-run as an initialisation strategy. GECCO 2017: 857-864 - 2016
- [c29]Carola Doerr
Women@GECCO 2016 Chairs' Welcome. GECCO (Companion) 2016: 1447-1449 - [c28]Thomas Jansen, Christine Zarges:
Example Landscapes to Support Analysis of Multimodal Optimisation. PPSN 2016: 792-802 - [c27]Christian Blum
The Workshops at PPSN 2016. PPSN 2016: 1007-1011 - 2015
- [j9]Thomas Jansen
Analysis of Randomised Search Heuristics for Dynamic Optimisation. Evol. Comput. 23(4): 513-541 (2015) - [j8]Pietro S. Oliveto
Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change. Theor. Comput. Sci. 561: 37-56 (2015) - [c26]Ayush Joshi, Jonathan E. Rowe, Christine Zarges
Improving the Performance of the Germinal Center Artificial Immune System Using \epsilon -Dominance: A Multi-objective Knapsack Problem Case Study. EvoCOP 2015: 114-125 - [c25]Dogan Corus
On Easiest Functions for Somatic Contiguous Hypermutations And Standard Bit Mutations. GECCO 2015: 1399-1406 - [e1]Jun He, Thomas Jansen, Gabriela Ochoa, Christine Zarges:
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, Aberystwyth, United Kingdom, January 17 - 20, 2015. ACM 2015, ISBN 978-1-4503-3434-1 [contents] - 2014
- [j7]Thomas Jansen
Performance analysis of randomised search heuristics operating with a fixed budget. Theor. Comput. Sci. 545: 39-58 (2014) - [j6]Thomas Jansen
Reevaluating Immune-Inspired Hypermutations Using the Fixed Budget Perspective. IEEE Trans. Evol. Comput. 18(5): 674-688 (2014) - [c24]Thomas Jansen
Artificial immune systems for optimisation. GECCO (Companion) 2014: 749-764 - [c23]Thomas Jansen
Evolutionary algorithms and artificial immune systems on a bi-stable dynamic optimisation problem. GECCO 2014: 975-982 - [c22]Ayush Joshi, Jonathan E. Rowe, Christine Zarges
An Immune-Inspired Algorithm for the Set Cover Problem. PPSN 2014: 243-251 - [c21]Pietro S. Oliveto, Dirk Sudholt, Christine Zarges
On the Runtime Analysis of Fitness Sharing Mechanisms. PPSN 2014: 932-941 - 2013
- [j5]Benjamin Doerr, Thomas Jansen
Mutation Rate Matters Even When Optimizing Monotonic Functions. Evol. Comput. 21(1): 1-27 (2013) - [c20]Thomas Jansen
Approximating vertex cover using edge-based representations. FOGA 2013: 87-96 - [c19]Thomas Jansen
Artificial immune systems for optimisation. GECCO (Companion) 2013: 779-796 - [c18]Pietro S. Oliveto
Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change. GECCO 2013: 837-844 - [c17]Benjamin Doerr, Thomas Jansen
A method to derive fixed budget results from expected optimisation times. GECCO 2013: 1581-1588 - 2012
- [c16]Thomas Jansen
Artificial immune systems for optimisation. GECCO (Companion) 2012: 1059-1078 - [c15]Thomas Jansen
Fixed budget computations: a different perspective on run time analysis. GECCO 2012: 1325-1332 - [c14]Thomas Jansen
Computing Longest Common Subsequences with the B-Cell Algorithm. ICARIS 2012: 111-124 - 2011
- [b1]Christine Zarges:
Theoretical Foundations of Artificial Immune Systems. Universität Dortmund, 2011, pp. I-V, 1-284 - [j4]Thomas Jansen
On the role of age diversity for effective aging operators. Evol. Intell. 4(2): 99-125 (2011) - [j3]Thomas Jansen
Analyzing different variants of immune inspired somatic contiguous hypermutations. Theor. Comput. Sci. 412(6): 517-533 (2011) - [j2]Thomas Jansen
On benefits and drawbacks of aging strategies for randomized search heuristics. Theor. Comput. Sci. 412(6): 543-559 (2011) - [c13]Thomas Jansen
Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering. FOGA 2011: 1-14 - [c12]Thomas Jansen
On the Analysis of the Immune-Inspired B-Cell Algorithm for the Vertex Cover Problem. ICARIS 2011: 117-131 - [c11]Thomas Jansen
Variation in Artificial Immune Systems: Hypermutations with Mutation Potential. ICARIS 2011: 132-145 - [p1]Christine Zarges:
Theorie künstlicher Immunsysteme. Ausgezeichnete Informatikdissertationen 2011: 301-310 - 2010
- [c10]Thomas Jansen
Aging beyond restarts. GECCO 2010: 705-712 - [c9]Thomas Jansen
On the Benefits of Aging and the Importance of Details. ICARIS 2010: 61-74 - [c8]Dirk Sudholt, Christine Zarges
Analysis of an Iterated Local Search Algorithm for Vertex Coloring. ISAAC (1) 2010: 340-352 - [c7]Benjamin Doerr, Thomas Jansen
Optimizing Monotone Functions Can Be Difficult. PPSN (1) 2010: 42-51 - [i1]Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges:
Optimizing Monotone Functions Can Be Difficult. CoRR abs/1010.1429 (2010)
2000 – 2009
- 2009
- [j1]Thomas Jansen, Melanie Schmidt
Ingo Wegener. Evol. Comput. 17(1): 1-2 (2009) - [c6]Christine Zarges
On the utility of the population size for inversely fitness proportional mutation rates. FOGA 2009: 39-46 - [c5]Christian Horoba, Thomas Jansen
Maximal age in randomized search heuristics with aging. GECCO 2009: 803-810 - [c4]Thomas Jansen
A Theoretical Analysis of Immune Inspired Somatic Contiguous Hypermutations for Function Optimization. ICARIS 2009: 80-94 - [c3]Thomas Jansen
Comparing Different Aging Operators. ICARIS 2009: 95-108 - 2008
- [c2]Christine Zarges
Rigorous Runtime Analysis of Inversely Fitness Proportional Mutation Rates. PPSN 2008: 112-122 - 2006
- [c1]Walter Nisticò, Matthias Hebbel, Thorsten Kerkhof, Christine Zarges:
Cooperative Visual Tracking in a Team of Autonomous Mobile Robots. RoboCup 2006: 146-157
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-12-02 21:24 CET 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: