default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Philip Runarsson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j11]Ali Ahrari, Thomas Philip Runarsson, Dries Verstraete:
A novel transformation to improve the robustness of value-based surrogate models. Swarm Evol. Comput. 92: 101794 (2025)- 2024
- [c37]Helga Ingimundardottir
, Thomas Philip Runarsson:
Evolving Submodels for Column Generation in Cutting and Packing for Glulam Production. CEC 2024: 1-8 - 2022
- [c36]Tómas Ingi Hrólfsson, Rúnar Unnsteinsson, Thomas Philip Runarsson:
Active model learning for the student nurse allocation problem. SSCI 2022: 1210-1217 - [i4]Ana Borovac, Steinn Gudmundsson, Gardar Thorvardsson, Saeed M. Moghadam, Päivi Nevalainen, Nathan J. Stevenson, Sampsa Vanhatalo, Thomas Philip Runarsson:
Ensemble learning using individual neonatal data for seizure detection. CoRR abs/2204.07043 (2022)
2010 – 2019
- 2019
- [c35]Thomas Philip Runarsson, Asgeir Orn Sigurpalsson:
Towards an evolutionary guided exact solution to elective surgery scheduling under uncertainty and ward restrictions. CEC 2019: 419-425 - [c34]Thomas Philip Runarsson:
Learning Probabilistic Constraints for Surgery Scheduling Using a Support Vector Machine. LION 2019: 121-134 - [c33]Thomas Philip Runarsson:
Approximating Probabilistic Constraints for Surgery Scheduling Using Neural Networks. LOD 2019: 643-654 - 2018
- [j10]Helga Ingimundardottir, Thomas Philip Runarsson:
Discovering dispatching rules from data using imitation learning: A case study for the job-shop problem. J. Sched. 21(4): 413-428 (2018) - 2017
- [c32]Thomas Philip Runarsson:
Deep Preference Neural Network for Move Prediction in Board Games. CGW@IJCAI 2017: 34-45 - 2015
- [c31]Thomas Philip Runarsson, Simon M. Lucas:
On imitating Connect-4 game trajectories using an approximate n-tuple evaluation function. CIG 2015: 208-213 - [c30]Helga Ingimundardottir, Thomas Philip Runarsson:
Generating Training Data for Learning Linear Composite Dispatching Rules for Scheduling. LION 2015: 236-248 - [c29]Kjartan Brjann Petursson, Thomas Philip Runarsson:
An Evolutionary Approach to the Discovery of Hybrid Branching Rules for Mixed Integer Solvers. SSCI 2015: 1436-1443 - 2014
- [j9]Thomas Philip Runarsson, Simon M. Lucas:
Preference Learning for Move Prediction and Evaluation Function Approximation in Othello. IEEE Trans. Comput. Intell. AI Games 6(3): 300-313 (2014) - [c28]Helga Ingimundardottir, Thomas Philip Runarsson:
Evolutionary Learning of Linear Composite Dispatching Rules for Scheduling. IJCCI (Selected Papers) 2014: 49-62 - [c27]Helga Ingimundardottir, Thomas Philip Runarsson:
Evolutionary Learning of Weighted Linear Composite Dispatching Rules for Scheduling. IJCCI (ECTA) 2014: 59-67 - [c26]Thomas Philip Runarsson:
Asynchronous Parallel (1+1)-CMA-ES for Constrained Global Optimisation. IJCCI (ECTA) 2014: 266-272 - [c25]Gudmundur Einarsson, Thomas Philip Runarsson, Gunnar Stefansson:
A competitive coevolution scheme inspired by DE. SDE 2014: 9-16 - 2013
- [j8]Spyridon Samothrakis, Simon M. Lucas, Thomas Philip Runarsson, David Robles:
Coevolving Game-Playing Agents: Measuring Performance and Intransitivities. IEEE Trans. Evol. Comput. 17(2): 213-226 (2013) - 2012
- [j7]Steinn Gudmundsson, Thomas Philip Runarsson, Sven Sigurdsson:
Test-retest reliability and feature selection in physiological time series classification. Comput. Methods Programs Biomed. 105(1): 50-60 (2012) - [c24]Thomas Philip Runarsson, Simon M. Lucas:
Imitating play from game trajectories: Temporal difference learning versus preference learning. CIG 2012: 79-82 - [c23]Thomas Philip Runarsson, Marc Schoenauer, Michèle Sebag:
Pilot, Rollout and Monte Carlo Tree Search Methods for Job Shop Scheduling. LION 2012: 160-174 - [c22]Helga Ingimundardottir, Thomas Philip Runarsson:
Determining the Characteristic of Difficult Job Shop Scheduling Instances for a Heuristic Solution Method. LION 2012: 408-412 - [i3]Juan Julián Merelo Guervós, Antonio Miguel Mora, Carlos Cotta, Thomas Philip Runarsson:
An experimental study of exhaustive solutions for the Mastermind puzzle. CoRR abs/1207.1315 (2012) - [i2]Thomas Philip Runarsson, Marc Schoenauer, Michèle Sebag:
Pilot, Rollout and Monte Carlo Tree Search Methods for Job Shop Scheduling. CoRR abs/1210.0374 (2012) - 2011
- [c21]Helga Ingimundardottir, Thomas Philip Runarsson:
Sampling strategies in ordinal regression for surrogate assisted evolutionary optimization. ISDA 2011: 1158-1163 - [c20]Helga Ingimundardottir, Thomas Philip Runarsson:
Supervised Learning Linear Priority Dispatch Rules for Job-Shop Scheduling. LION 2011: 263-277 - [c19]Thomas Philip Runarsson:
Learning Heuristic Policies - A Reinforcement Learning Problem. LION 2011: 423-432 - 2010
- [j6]Steinn Gudmundsson, Gudny Lilja Oddsdottir, Thomas Philip Runarsson, Sven Sigurdsson, Eythor Kristjansson:
Detecting fraudulent whiplash claims by support vector machines. Biomed. Signal Process. Control. 5(4): 311-317 (2010) - [c18]Juan Julián Merelo Guervós, Antonio Miguel Mora, Thomas Philip Runarsson, Carlos Cotta:
Assessing efficiency of different evolutionary strategies playing MasterMind. CIG 2010: 38-45 - [c17]Juan Julián Merelo Guervós, Thomas Philip Runarsson:
Finding Better Solutions to the Mastermind Puzzle Using Evolutionary Algorithms. EvoApplications (1) 2010: 121-130 - [c16]Juan Julián Merelo Guervós, Antonio Miguel Mora, Thomas Philip Runarsson:
Beating exhaustive search at its own game: revisiting evolutionary mastermind. GECCO 2010: 291-292 - [c15]Thomas Philip Runarsson, Juan Julián Merelo Guervós:
Adapting Heuristic Mastermind Strategies to Evolutionary Algorithms. NICSO 2010: 255-267 - [c14]Carlos Cotta, Juan Julián Merelo Guervós, Antonio Mora García, Thomas Philip Runarsson:
Entropy-Driven Evolutionary Approaches to the Mastermind Problem. PPSN (2) 2010: 421-431
2000 – 2009
- 2009
- [i1]Thomas Philip Runarsson, Juan Julián Merelo Guervós:
Adapting Heuristic Mastermind Strategies to Evolutionary Algorithms. CoRR abs/0912.2415 (2009) - 2008
- [c13]Steinn Gudmundsson, Thomas Philip Runarsson, Sven Sigurdsson:
Support vector machines and dynamic time warping for time series. IJCNN 2008: 2772-2776 - 2007
- [c12]Thomas Philip Runarsson, Egill Orn Jonsson:
Effect of look-ahead search depth in learning position evaluation functions for Othello using -greedy exploration. CIG 2007: 210-215 - 2006
- [c11]Thomas Philip Runarsson:
Approximate Evolution Strategy using Stochastic Ranking. IEEE Congress on Evolutionary Computation 2006: 745-752 - [c10]Simon M. Lucas, Thomas Philip Runarsson:
Temporal Difference Learning Versus Co-Evolution for Acquiring Othello Position Evaluation. CIG 2006: 52-59 - [c9]Thomas Philip Runarsson:
Ordinal Regression in Evolutionary Computation. PPSN 2006: 1048-1057 - [e1]Thomas Philip Runarsson, Hans-Georg Beyer, Edmund K. Burke, Juan Julián Merelo Guervós, L. Darrell Whitley, Xin Yao:
Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, Reykjavik, Iceland, September 9-13, 2006, Procedings. Lecture Notes in Computer Science 4193, Springer 2006, ISBN 3-540-38990-3 [contents] - 2005
- [j5]Thomas Philip Runarsson, Simon M. Lucas:
Coevolution versus self-play temporal difference learning for acquiring position evaluation in small-board go. IEEE Trans. Evol. Comput. 9(6): 628-640 (2005) - [j4]Thomas Philip Runarsson, Xin Yao:
Search biases in constrained evolutionary optimization. IEEE Trans. Syst. Man Cybern. Part C 35(2): 233-243 (2005) - [c8]Steinn Gudmundsson, Thomas Philip Runarsson, Sven Sigurdsson:
Automatic Sleep Staging using Support Vector Machines with Posterior Probability Estimates. CIMCA/IAWTIC 2005: 366-372 - [c7]Thomas Philip Runarsson, Sven Sigurdsson:
On-line Detection of Patient Specific Neonatal Seizures using Support Vector Machines and Half-Wave Attribute Histograms. CIMCA/IAWTIC 2005: 673-677 - 2004
- [c6]Thomas Philip Runarsson:
Constrained Evolutionary Optimization by Approximate Ranking and Surrogate Models. PPSN 2004: 401-410 - 2003
- [j3]Thomas Philip Runarsson:
An Asynchronous Parallel Evolution Strategy. Int. J. Comput. Intell. Appl. 3(4): 381-394 (2003) - [c5]Thomas Philip Runarsson, Xin Yao:
Evolutionary search and constraint violations. IEEE Congress on Evolutionary Computation 2003: 1414-1419 - 2002
- [c4]Thomas Philip Runarsson, Xin Yao:
Continuous selection and self-adaptive evolution strategies. IEEE Congress on Evolutionary Computation 2002: 279-284 - [c3]Thomas Philip Runarsson:
Reducing Random Fluctuations in Mutative Self-adaptation. PPSN 2002: 194-203 - 2000
- [j2]Thomas Philip Runarsson, Xin Yao:
Stochastic ranking for constrained evolutionary optimization. IEEE Trans. Evol. Comput. 4(3): 284-294 (2000)
1990 – 1999
- 1999
- [j1]Thomas Philip Runarsson, Magnus Thor Jonsson:
Genetic production systems for intelligent problem solving. J. Intell. Manuf. 10(2): 181-186 (1999) - 1998
- [c2]Thomas Philip Runarsson, Magnus Thor Jonsson:
Evolution of Gene Coordination Networks. SEAL 1998: 430-437 - 1996
- [c1]Thomas Philip Runarsson, Magnus Thor Jonsson, Pall Jensson:
Dynamic Dual Bin Packing Using Fuzzy Objectives. International Conference on Evolutionary Computation 1996: 219-222
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 2025-01-14 22:20 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:
