default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBart Naudts
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j7]Kristof Engelen
, Bart Naudts, Bart De Moor, Kathleen Marchal:
A calibration method for estimating absolute expression levels from microarray data. Bioinform. 22(10): 1251-1258 (2006)- [j6]Tim Van den Bulcke, Koen Van Leemput, Bart Naudts, Piet van Remortel, Hongwu Ma, Alain Verschoren, Bart De Moor, Kathleen Marchal:
SynTReN: a generator of synthetic gene expression data for design and analysis of structure learning algorithms. BMC Bioinform. 7: 43 (2006) - 2005
- [c16]Maria Teresa Iglesias, Bart Naudts, Alain Verschoren, Concepción Vidal:
Walsh transforms, balanced sum theorems and partition coefficients over multary alphabets. GECCO 2005: 1303-1308 - 2004
- [c15]Michal J. Okoniewski, Bart Naudts:
Testing microarray analysis methods with semi-synthetic data. Intelligent Information Systems 2004: 69-77 - 2003
- [j5]Martin Dietzfelbinger, Bart Naudts, Clarissa Van Hoyweghen, Ingo Wegener:
The analysis of a recombinative hill-climber on H-IFF. IEEE Trans. Evol. Comput. 7(5): 417-423 (2003) - [c14]Walter Daelemans, Véronique Hoste, Fien De Meulder, Bart Naudts:
Combined Optimization of Feature Selection and Algorithm Parameters in Machine Learning of Language. ECML 2003: 84-95 - 2002
- [j4]Clarissa Van Hoyweghen, Bart Naudts, David E. Goldberg:
Spin-Flip Symmetry and Synchronization. Evol. Comput. 10(4): 317-344 (2002) - [j3]Bart Naudts, Luk Schoofs:
GA performance distributions and randomly generated binary constraint satisfaction problems. Theor. Comput. Sci. 287(1): 167-185 (2002) - [c13]Luk Schoofs, Bart Naudts:
Swarm intelligence on the binary constraint satisfaction problem. IEEE Congress on Evolutionary Computation 2002: 1444-1449 - [c12]Clarissa Van Hoyweghen, David E. Goldberg, Bart Naudts:
From Twomax To The Ising Model: Easy And Hard Symmetrical Problems. GECCO 2002: 626-633 - 2000
- [j2]Bart Naudts, Dominique Suys, Alain Verschoren:
Generalized Royal Road Functions and Their Epistasis. Comput. Artif. Intell. 19(4): 317-334 (2000) - [j1]Bart Naudts, Leila Kallel:
A comparison of predictive measures of problem difficulty in evolutionary algorithms. IEEE Trans. Evol. Comput. 4(1): 1-15 (2000) - [c11]Ives Landrieu, Bart Naudts:
An object model for search spaces and their transformations. CEC 2000: 811-816 - [c10]Clarissa Van Hoyweghen, Bart Naudts:
Symmetry in the search space. CEC 2000: 1072-1078 - [c9]Luk Schoofs, Bart Naudts:
Ant colonies are good at solving constraint satisfaction problems. CEC 2000: 1190-1195 - [c8]Bart Naudts, Ives Landrieu:
Comparing population mean curves. FOGA 2000: 109-126 - [c7]Luk Schoofs, Bart Naudts:
Solving CSP Instances Beyond the Phase Transition Using Stochastic Search Algorithms. PPSN 2000: 549-558
1990 – 1999
- 1999
- [c6]Luk Schoofs, Bart Naudts, Ives Landrieu:
SAWing on symmetry. CEC 1999: 589-595 - [c5]Leila Kallel, Bart Naudts, Marc Schoenauer:
On functions with a given fitness-distance relation. CEC 1999: 1910-1916 - 1998
- [c4]Leila Kallel, Bart Naudts:
Candidate Longpaths for the Simple Genetic Algorithm. FOGA 1998: 27-43 - [c3]Bart Naudts, Jan Naudts:
The Effect of Spin-Flip Symmetry on the Performance of the Simple GA. PPSN 1998: 67-76 - 1997
- [c2]Bart Naudts, Alain Verschoren:
SGA Search Dynamics on Second Order Functions. Artificial Evolution 1997: 207-222 - [c1]Bart Naudts, Dominique Suys, Alain Verschoren:
Epistasis as a Basic Concept in Formal Landscape Analysis. ICGA 1997: 65-72
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-04-25 05:49 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:
