default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMihai Oltean
Person information
- affiliation: "1 Decembrie 1918" University of Alba-Iulia, Romania
- affiliation (former): Babeş-Bolyai University, Cluj-Napoca, Romania
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i25]Mihai Oltean:
Liquid State Genetic Programming. CoRR abs/2312.14942 (2023)- 2022
- [i24]Mihai Oltean:
Multi Expression Programming for solving classification problems. CoRR abs/2203.13202 (2022) - [i23]Sanda Maria Avram, Mihai Oltean:
A comparison of several AI techniques for authorship attribution on Romanian texts. CoRR abs/2211.05180 (2022) - 2021
- [i22]Mihai Oltean
, Crina Grosan, Mihaela Oltean:
Evolving Digital Circuits for the Knapsack Problem. CoRR abs/2109.13107 (2021) - [i21]Mihai Oltean:
Evolving winning strategies for Nim-like games. CoRR abs/2109.13109 (2021) - [i20]Mihai Oltean:
Evolving Evolutionary Algorithms using Linear Genetic Programming. CoRR abs/2109.13110 (2021) - [i19]Mihai Oltean:
Evolving reversible circuits for the even-parity problem. CoRR abs/2109.13355 (2021) - [i18]Mihai Oltean, Crina Grosan:
Evolving Evolutionary Algorithms using Multi Expression Programming. CoRR abs/2109.13737 (2021) - [i17]Mihai Oltean:
Searching for a practical evidence of the No Free Lunch theorems. CoRR abs/2109.13738 (2021) - [i16]Mihai Oltean:
Multi Expression Programming - an in-depth description. CoRR abs/2110.00367 (2021) - [i15]Mihai Oltean:
New Evolutionary Computation Models and their Applications to Machine Learning. CoRR abs/2110.00468 (2021) - [i14]Mihai Oltean:
Solving even-parity problems using traceless genetic programming. CoRR abs/2110.02014 (2021) - [i13]Mihai Oltean:
Evolving Evolutionary Algorithms with Patterns. CoRR abs/2110.05951 (2021) - [i12]Mihai Oltean:
Improving the Search by Encoding Multiple Solutions in a Chromosome. CoRR abs/2110.11239 (2021) - [i11]Mihai Oltean, Crina Grosan:
Using Traceless Genetic Programming for Solving Multiobjective Optimization Problems. CoRR abs/2110.13608 (2021) - [i10]Mihai Oltean:
Solving classification problems using Traceless Genetic Programming. CoRR abs/2111.14790 (2021)
2010 – 2019
- 2019
- [i9]Mihai Oltean:
Jenny 5 - the robot. CoRR abs/1908.01826 (2019) - 2017
- [i8]Horea Muresan, Mihai Oltean:
Fruit recognition from images using deep learning. CoRR abs/1712.00580 (2017) - [i7]Mihai Oltean:
An optical solution for the set splitting problem. CoRR abs/1712.00651 (2017) - 2015
- [j18]Shlomi Dolev, Mihai Oltean:
Optical SuperComputing: Preface to special issue. Nat. Comput. 14(3): 431-432 (2015) - [i6]Mihai Oltean, Dumitru Dumitrescu:
Evolving TSP heuristics using Multi Expression Programming. CoRR abs/1509.02459 (2015) - [i5]Mihai Oltean, Oana Muntean:
Solving NP-complete problems with delayed signals: an overview of current research directions. CoRR abs/1509.02673 (2015) - 2013
- [e4]Shlomi Dolev, Mihai Oltean:
Optical Supercomputing - 4th International Workshop, OSC 2012, in Memory of H. John Caulfield, Bertinoro, Italy, July 19-21, 2012. Revised Selected Papers. Lecture Notes in Computer Science 7715, Springer 2013, ISBN 978-3-642-38249-9 [contents] - 2012
- [j17]Shlomi Dolev, Tobias Haist, Mihai Oltean:
Optical supercomputing: introduction to special issue. J. Supercomput. 62(2): 617-619 (2012) - 2011
- [j16]Laura Diosan, Mihai Oltean:
Friction-based sorting. Nat. Comput. 10(1): 527-539 (2011) - [e3]Shlomi Dolev, Mihai Oltean:
Optical Supercomputing - Third International Workshop, OSC 2010, Bertinoro, Italy, November 17-19, 2010, Revised Selected Papers. Lecture Notes in Computer Science 6748, Springer 2011, ISBN 978-3-642-22493-5 [contents] - 2010
- [j15]Shlomi Dolev, Tobias Haist, Mihai Oltean:
Introduction to special issue on Optical SuperComputing. Nat. Comput. 9(4): 889-890 (2010) - [c30]Mihai Oltean, Oana Muntean:
An Optical Solution for the SAT Problem. OSC 2010: 53-62
2000 – 2009
- 2009
- [j14]Mihai Oltean, Laura Diosan:
An autonomous GP-based system for regression and classification problems. Appl. Soft Comput. 9(1): 49-60 (2009) - [j13]Laura Diosan, Mihai Oltean:
Evolutionary design of Evolutionary Algorithms. Genet. Program. Evolvable Mach. 10(3): 263-306 (2009) - [j12]Mihai Oltean, Crina Grosan, Laura Diosan, Cristina Mihaila:
Genetic Programming with Linear Representation: a Survey. Int. J. Artif. Intell. Tools 18(2): 197-238 (2009) - [j11]Mihai Oltean:
Light-based string matching. Nat. Comput. 8(1): 121-132 (2009) - [j10]Mihai Oltean, Oana Muntean:
Solving the subset-sum problem with a light-based device. Nat. Comput. 8(2): 321-331 (2009) - [c29]Mihai Oltean, Oana Muntean:
Evolutionary Design of Graph-Based Structures for Optical Computing. OSC 2009: 56-69 - [e2]Shlomi Dolev, Mihai Oltean:
Optical SuperComputing, Second International Workshop, OSC 2009, Bertinoro, Italy, November 18-20, 2009. Proceedings. Lecture Notes in Computer Science 5882, Springer 2009, ISBN 978-3-642-10441-1 [contents] - 2008
- [j9]Mihai Oltean:
Solving the Hamiltonian path problem with a light-based computer. Nat. Comput. 7(1): 57-70 (2008) - [j8]Mihai Oltean, Oana Muntean:
Exact Cover with Light. New Gener. Comput. 26(4): 329-346 (2008) - [c28]Mihai Oltean, Laura Diosan:
An Adaptive GP Strategy for Evolving Digital Circuits. KES (3) 2008: 376-383 - [c27]Mihai Oltean, Oana Muntean:
Solving NP-Complete Problems with Delayed Signals: An Overview of Current Research Directions. OSC 2008: 115-127 - [e1]Shlomi Dolev, Tobias Haist, Mihai Oltean:
Optical Super Computing, First International Workshop, OSC 2008, Vienna, Austria, August 26, 2008. Proceedings. Lecture Notes in Computer Science 5172, Springer 2008, ISBN 978-3-540-85672-6 [contents] - 2007
- [j7]Laura Diosan, Mihai Oltean:
Evolving the Update Strategy of the Particle Swarm Optimisation Algorithms. Int. J. Artif. Intell. Tools 16(1): 87-110 (2007) - [j6]Mihai Oltean, Crina Grosan:
Using traceless genetic programming for solving multi-objective optimization problems. J. Exp. Theor. Artif. Intell. 19(3): 227-248 (2007) - [j5]Mihai Oltean:
A-Brain: a general system for solving data analysis problems. J. Exp. Theor. Artif. Intell. 19(4): 333-353 (2007) - [j4]Mihai Oltean:
Evolving Evolutionary Algorithms with Patterns. Soft Comput. 11(6): 503-518 (2007) - [c26]Oana Muntean, Laura Diosan, Mihai Oltean:
Solving the even-n-parity problems using Best SubTree Genetic Programming. AHS 2007: 511-518 - [c25]Oana Muntean, Mihai Oltean:
Processing Bank Checks with Genetic Programming and Histograms. BLISS 2007: 102-105 - [c24]Oana Muntean, Laura Diosan, Mihai Oltean:
Best SubTree genetic programming. GECCO 2007: 1667-1673 - [c23]Laura Diosan, Mihai Oltean, Alexandrina Rogozan, Jean-Pierre Pécuchet:
Genetically designed multiple-kernels for improving the SVM performance. GECCO 2007: 1873 - [c22]Laura Diosan, Mihai Oltean:
Evolving evolutionary algorithms using evolutionary algorithms. GECCO (Companion) 2007: 2442-2449 - [c21]Laura Diosan, Mihai Oltean:
Observing the swarm behaviour during its evolutionary design. GECCO (Companion) 2007: 2667-2674 - [c20]Laura Diosan, Mihai Oltean, Alexandrina Rogozan, Jean-Pierre Pécuchet:
Improving SVM Performance Using a Linear Combination of Kernels. ICANNGA (2) 2007: 218-227 - [c19]Mihai Oltean:
Liquid State Genetic Programming. ICANNGA (1) 2007: 220-229 - [c18]Laura Diosan, Mihai Oltean:
Who's better? PESA or NSGA II? ISDA 2007: 869-874 - [i4]Mihai Oltean:
A Light-Based Device for Solving the Hamiltonian Path Problem. CoRR abs/0708.1496 (2007) - [i3]Mihai Oltean:
Solving the Hamiltonian path problem with a light-based computer. CoRR abs/0708.1512 (2007) - [i2]Mihai Oltean, Oana Muntean:
Exact Cover with light. CoRR abs/0708.1962 (2007) - [i1]Mihai Oltean, Oana Muntean:
Solving the subset-sum problem with a light-based device. CoRR abs/0708.1964 (2007) - 2006
- [c17]Mihai Oltean:
Switchable Glass: A Possible Medium for Evolvable Hardware. AHS 2006: 81-87 - [c16]Laura Diosan, Mihai Oltean:
Evolving Crossover Operators for Function Optimization. EuroGP 2006: 97-108 - [c15]Laura Diosan, Mihai Oltean:
Evolving the Structure of the Particle Swarm Optimization Algorithms. EvoCOP 2006: 25-36 - [c14]Mihai Oltean:
A-Brain: the multiple problems solver. SAC 2006: 955-959 - [c13]Mihai Oltean:
A Light-Based Device for Solving the Hamiltonian Path Problem. UC 2006: 217-227 - 2005
- [j3]Mihai Oltean:
Evolving Evolutionary Algorithms Using Linear Genetic Programming. Evol. Comput. 13(3): 387-410 (2005) - [j2]Crina Grosan, Mihai Oltean:
Adaptive representation for single objective optimization. Soft Comput. 9(8): 594-605 (2005) - [c12]Mihai Oltean:
Evolving Reversible Circuits for the Even-Parity Problem. EvoWorkshops 2005: 225-234 - [c11]Mihai Oltean, Crina Grosan, Ajith Abraham, Mario Köppen:
Multiobjective Optimization Using Adaptive Pareto Archived Evolution Strategy. ISDA 2005: 558-563 - [p1]D. Dumitrescu, Crina Grosan, Mihai Oltean:
Evolving Continuous Pareto Regions. Evolutionary Multiobjective Optimization 2005: 167-199 - 2004
- [c10]Mihai Oltean:
Searching for a Practical Evidence of the No Free Lunch Theorems. BioADIT 2004: 472-483 - [c9]Mihai Oltean:
Solving even-parity problems using traceless genetic programming. IEEE Congress on Evolutionary Computation 2004: 1813-1819 - [c8]Mihai Oltean, Crina Grosan:
Evolving Digital Circuits using Multi Expression Programming. Evolvable Hardware 2004: 87-90 - [c7]Mihai Oltean, D. Dumitrescu:
Evolving TSP Heuristics Using Multi Expression Programming. International Conference on Computational Science 2004: 670-673 - [c6]Crina Grosan, Mihai Oltean:
Improving the Performance of Evolutionary Algorithms for the Multiobjective 0/1 Knapsack Problem Using e-Dominance. International Conference on Computational Science 2004: 674-677 - [c5]Mihai Oltean, Crina Grosan, Mihaela Oltean:
Designing Digital Circuits for the Knapsack Problem. International Conference on Computational Science 2004: 1257-1264 - [c4]Mihai Oltean, Crina Grosan, Mihaela Oltean:
Encoding Multiple Solutions in a Linear Genetic Programming Chromosome. International Conference on Computational Science 2004: 1281-1288 - [c3]Mihai Oltean:
Evolving Winning Strategies for Nim-like Games. IFIP Student Forum 2004: 353-364 - 2003
- [j1]Mihai Oltean, Crina Grosan:
A Comparison of Several Linear Genetic Programming Techniques. Complex Syst. 14(4) (2003) - [c2]Mihai Oltean, Crina Grosan:
Evolving Evolutionary Algorithms Using Multi Expression Programming. ECAL 2003: 651-658 - [c1]Mihai Oltean, Crina Grosan:
Solving Classification Problems Using Infix Form Genetic Programming. IDA 2003: 242-253
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:44 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:
