default search action
David Iclanzan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j3]Zoltán Kátai, David Iclanzan:
Impact of instructor on-slide presence in synchronous e-learning. Educ. Inf. Technol. 28(3): 3089-3115 (2023) - [c40]David Iclanzan, Zoltán Kátai:
A Framework for Effective Guided Mnemonic Journeys. ICCS (5) 2023: 751-765 - 2021
- [c39]David Iclanzan, Rodica Ioana Lung, Zsolt Levente Kucsván, Béla Surányi, Levente Kovács, László Szilágyi:
The role of atlases and multi-atlases in brain tissue segmentation based on multispectral magnetic resonance image data. AFRICON 2021: 1-6 - [c38]David Iclanzan, Zoltán Kátai:
Increasing the Impact of Teacher Presence in Online Lectures. ICCS (6) 2021: 626-639 - 2020
- [c37]Mózes Vidámi, László Szilágyi, David Iclanzan:
Real Valued Card Counting Strategies for the Game of Blackjack. ICONIP (2) 2020: 63-73 - [c36]Szabolcs Csaholczi, David Iclanzan, Levente Kovács, László Szilágyi:
Brain Tumor Segmentation from Multi-spectral MR Image Data Using Random Forest Classifier. ICONIP (1) 2020: 174-184
2010 – 2019
- 2019
- [j2]Katalin Tunde Janosi-Rancz, Zoltán Kátai, David Iclanzan:
Linking Formal and Informal Structures based on Members' E-mail Communication Patterns. Aust. J. Intell. Inf. Process. Syst. 17(1): 9-16 (2019) - [c35]Ágnes Gyorfi, Zoltán Karetka-Mezei, David Iclanzan, Levente Kovács, László Szilágyi:
A Study on Histogram Normalization for Brain Tumour Segmentation from Multispectral MR Image Data. CIARP 2019: 375-384 - [c34]David Iclanzan, László Szilágyi:
Learning to Generate Ambiguous Sequences. ICONIP (1) 2019: 110-121 - 2018
- [c33]David Iclanzan, Sándor Miklós Szilágyi, László Szilágyi:
Evolving Computationally Efficient Hashing for Similarity Search. ICONIP (2) 2018: 552-563 - 2017
- [c32]Zoltán Kapás, László Lefkovits, David Iclanzan, Ágnes Gyorfi, Barna László Iantovics, Szidónia Lefkovits, Sándor Miklós Szilágyi, László Szilágyi:
Automatic Brain Tumor Segmentation in Multispectral MRI Volumes Using a Random Forest Approach. PSIVT 2017: 137-149 - 2015
- [c31]László Szilágyi, László Lefkovits, Barna Iantovics, David Iclanzan, Balázs Benyó:
Automatic Brain Tumor Segmentation in Multispectral MRI Volumetric Records. ICONIP (4) 2015: 174-181 - [c30]David Iclanzan, László Szilágyi:
Neural Population Coding of Stimulus Features. ICONIP (4) 2015: 263-270 - 2014
- [c29]David Iclanzan:
Global Optimization of Multimodal Deceptive Functions. EvoCOP 2014: 145-156 - [c28]David Iclanzan, Fabio Daolio, Marco Tomassini:
Learning Inherent Networks from Stochastic Search Methods. EvoCOP 2014: 157-169 - [c27]David Iclanzan, Fabio Daolio, Marco Tomassini:
Data-driven local optima network characterization of QAPLIB instances. GECCO 2014: 453-460 - 2013
- [j1]David Iclanzan, Anca Gog, Camelia Chira:
Cell state change dynamics in cellular automata. Memetic Comput. 5(2): 131-139 (2013) - [c26]David Iclanzan, Noémi Gaskó, Réka Nagy, D. Dumitrescu:
Multiobjective Evolution of Mixed Nash Equilibria. LION 2013: 304-314 - 2012
- [c25]Camelia Chira, Anca Gog, David Iclanzan:
Evolutionary detection of community structures in complex networks: A new fitness function. IEEE Congress on Evolutionary Computation 2012: 1-8 - [c24]David Iclanzan, Camelia Chira:
Modeling and replicating higher-order dependencies in genetic algorithms. IEEE Congress on Evolutionary Computation 2012: 1-8 - [c23]David Iclanzan:
Higher-order linkage learning in the ECGA. GECCO 2012: 265-272 - [c22]David Iclanzan, Noémi Gaskó, D. Dumitrescu:
Evolving mixed nash equilibria for bimatrix games. GECCO (Companion) 2012: 655-656 - [c21]David Iclanzan:
A Multi-parent Search Operator for Bayesian Network Building. PPSN (1) 2012: 246-255 - 2011
- [c20]László Szilágyi, Sándor M. Szilágyi, David Iclanzan, Lehel Szabó:
Efficient 3D Curve Skeleton Extraction from Large Objects. CIARP 2011: 133-140 - [c19]László Szilágyi, David Iclanzan, Lehel Craciun, Sándor M. Szilágyi:
An Efficient Approach to Intensity Inhomogeneity Compensation Using c-Means Clustering Models. CIARP 2011: 312-319 - [c18]David Iclanzan:
Hierarchical allelic pairwise independent functions. GECCO 2011: 633-640 - [c17]David Iclanzan, Péter István Fülöp, Camelia Chira, Anca Gog:
Towards the efficient evolution of particle-based computation in cellular automata. GECCO (Companion) 2011: 835-836 - [c16]David Iclanzan, Anca Gog, Camelia Chira:
Enhancing the Computational Mechanics of Cellular Automata. NICSO 2011: 267-283 - 2010
- [c15]David Iclanzan, Dumitru Dumitrescu:
Graph Clustering Based Model Building. PPSN (1) 2010: 506-515
2000 – 2009
- 2009
- [c14]David Iclanzan, Béat Hirsbrunner, Michèle Courant, D. Dumitrescu:
Cooperation in the context of sustainable search. IEEE Congress on Evolutionary Computation 2009: 1904-1911 - [c13]László Szilágyi, David Iclanzan, Sándor M. Szilágyi, Dan Dumitrescu, Béat Hirsbrunner:
A generalized c-means clustering model using optimized via evolutionary computation. FUZZ-IEEE 2009: 451-455 - [c12]David Iclanzan, D. Dumitrescu, Béat Hirsbrunner:
Correlation guided model building. GECCO 2009: 421-428 - [c11]Sándor M. Szilágyi, László Szilágyi, David Iclanzan, Zoltán Benyó:
A weighted patient specific electromechanical model of the heart. SACI 2009: 111-116 - 2008
- [c10]David Iclanzan, Dan Dumitrescu:
How can Artificial Neural Networks help making the intractable search spaces tractable. IEEE Congress on Evolutionary Computation 2008: 4015-4022 - [c9]László Szilágyi, David Iclanzan, Sándor M. Szilágyi, Dan Dumitrescu:
GeCiM: A Novel Generalized Approach to C-Means Clustering. CIARP 2008: 235-242 - [c8]David Iclanzan, D. Dumitrescu:
Going for the big fishes: discovering and combining large neutral and massively multimodal building-blocks with model based macro-mutation. GECCO 2008: 423-430 - [c7]David Iclanzan, Dumitru Dumitrescu:
Towards memoryless model building. GECCO (Companion) 2008: 2147-2152 - [c6]David Iclanzan, Dumitru Dumitrescu:
Large-Scale Optimization of Non-separable Building-Block Problems. PPSN 2008: 899-908 - 2007
- [c5]David Iclanzan:
The Creativity Potential Within Evolutionary Algorithms. ECAL 2007: 845-854 - [c4]David Iclanzan, Dan Dumitrescu:
Overcoming hierarchical difficulty by hill-climbing the building block structure. GECCO 2007: 1256-1263 - [c3]David Iclanzan:
Crossover: the divine afflatus in search. GECCO (Companion) 2007: 2497-2502 - [c2]David Iclanzan, D. Dumitrescu:
Overrepresentations in Neutral Genotype-Phenotype Mappings and their Applications. SYNASC 2007: 427-432 - [c1]David Iclanzan, Péter István Fülöp, D. Dumitrescu:
Neuro-Hill-Climber: A New Approach Towards More Intelligent Search and Optimization. SYNASC 2007: 441-448 - [i1]David Iclanzan, Dan Dumitrescu:
Overcoming Hierarchical Difficulty by Hill-Climbing the Building Block Structure. CoRR abs/cs/0702096 (2007)
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:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint