default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJörn Grahl
Person information
- affiliation: Universität zu Köln, Cologne, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j7]Xitong Li
, Jörn Grahl, Oliver Hinz:
How Do Recommender Systems Lead to Consumer Purchases? A Causal Mediation Analysis of a Field Experiment. Inf. Syst. Res. 33(2): 620-637 (2022)- [j6]Andreas Fügener, Jörn Grahl, Alok Gupta, Wolfgang Ketter:
Cognitive Challenges in Human-Artificial Intelligence Collaboration: Investigating the Path Toward Productive Delegation. Inf. Syst. Res. 33(2): 678-696 (2022) - 2021
- [j5]Andreas Fügener, Jörn Grahl, Alok Gupta, Wolfgang Ketter:
Will Humans-in-the-Loop Become Borgs? Merits and Pitfalls of Working with AI. MIS Q. 45(3) (2021) - [c12]Andreas Fügener, Jörn Grahl, Alok Gupta, Wolfgang Ketter, Anna Taudien:
Exploring User Heterogeneity in Human Delegation Behavior towards AI. ICIS 2021
2010 – 2019
- 2017
- [j4]Malte Probst, Franz Rothlauf, Jörn Grahl:
Scalability of using Restricted Boltzmann Machines for combinatorial optimization. Eur. J. Oper. Res. 256(2): 368-383 (2017) - 2016
- [j3]Jörn Grahl, Stefan Minner, Daniel Dittmar:
Meta-heuristics for placing strategic safety stock in multi-echelon inventory with differentiated service times. Ann. Oper. Res. 242(2): 489-504 (2016) - [i3]Pascal Budner, Jörn Grahl:
Collaboration Networks in the Music Industry. CoRR abs/1611.00377 (2016) - 2014
- [c11]Malte Probst, Franz Rothlauf, Jörn Grahl:
An implicitly parallel EDA based on restricted boltzmann machines. GECCO 2014: 1055-1062 - [i2]Sebastian Herrmann, Jörn Grahl, Franz Rothlauf:
Problem Complexity in Parallel Problem Solving. CoRR abs/1403.6330 (2014) - [i1]Malte Probst, Franz Rothlauf, Jörn Grahl:
Scalability of using Restricted Boltzmann Machines for Combinatorial Optimization. CoRR abs/1411.7542 (2014) - 2013
- [j2]Peter A. N. Bosman, Jörn Grahl, Dirk Thierens:
Benchmarking Parameter-Free AMaLGaM on Functions With and Without Noise. Evol. Comput. 21(3): 445-469 (2013) - 2011
- [e2]Cecilia Di Chio, Anthony Brabazon, Gianni A. Di Caro, Rolf Drechsler, Muddassar Farooq, Jörn Grahl, Gary Greenfield, Christian Prins, Juan Romero, Giovanni Squillero, Ernesto Tarantino, Andrea Tettamanzi, Neil Urquhart, A. Sima Etaner-Uyar:
Applications of Evolutionary Computation - EvoApplications 2011: EvoCOMNET, EvoFIN, EvoHOT, EvoMUSART, EvoSTIM, and EvoTRANSLOG, Torino, Italy, April 27-29, 2011, Proceedings, Part II. Lecture Notes in Computer Science 6625, Springer 2011, ISBN 978-3-642-20519-4 [contents] - 2010
- [e1]Cecilia Di Chio, Anthony Brabazon, Gianni A. Di Caro, Marc Ebner, Muddassar Farooq, Andreas Fink, Jörn Grahl, Gary Greenfield, Penousal Machado, Michael O'Neill, Ernesto Tarantino, Neil Urquhart:
Applications of Evolutionary Computation, EvoApplications 2010: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoMUSART, and EvoTRANSLOG, Istanbul, Turkey, April 7-9, 2010, Proceedings, Part II. Lecture Notes in Computer Science 6025, Springer 2010, ISBN 978-3-642-12241-5 [contents]
2000 – 2009
- 2009
- [c10]Peter A. N. Bosman, Jörn Grahl, Dirk Thierens:
AMaLGaM IDEAs in noiseless black-box optimization benchmarking. GECCO (Companion) 2009: 2247-2254 - [c9]Peter A. N. Bosman, Jörn Grahl, Dirk Thierens:
AMaLGaM IDEAs in noisy black-box optimization benchmarking. GECCO (Companion) 2009: 2351-2358 - 2008
- [j1]Peter A. N. Bosman, Jörn Grahl:
Matching inductive search bias and problem structure in continuous Estimation-of-Distribution Algorithms. Eur. J. Oper. Res. 185(3): 1246-1264 (2008) - [c8]Peter A. N. Bosman, Jörn Grahl, Dirk Thierens:
Enhancing the Performance of Maximum-Likelihood Gaussian EDAs Using Anticipated Mean Shift. PPSN 2008: 133-143 - [p1]Jörn Grahl, Stefan Minner, Peter A. N. Bosman:
Learning Structure Illuminates Black Boxes - An Introduction to Estimation of Distribution Algorithms. Advances in Metaheuristics for Hard Optimization 2008: 365-395 - 2007
- [c7]Thomas Butter, Franz Rothlauf, Jörn Grahl, Tobias Hildenbrand, Jens Arndt:
Genetic Algorithms for Finding Optimal Strategies for a Student's Game. CIG 2007: 346-351 - [c6]Peter A. N. Bosman, Jörn Grahl, Franz Rothlauf:
SDR: a better trigger for adaptive variance scaling in normal EDAs. GECCO 2007: 492-499 - [c5]Jörn Grahl, Peter A. N. Bosman, Stefan Minner:
Convergence phases, variance trajectories, and runtime analysis of continuous EDAs. GECCO 2007: 516-522 - 2006
- [c4]Jörn Grahl, Peter A. N. Bosman, Franz Rothlauf:
The correlation-triggered adaptive variance scaling IDEA. GECCO 2006: 397-404 - [c3]Thomas Butter, Franz Rothlauf, Jörn Grahl, Tobias Hildenbrand, Jens Arndt:
Genetic algorithms and mixed integer linear programs for optimal strategies in a student's "sports" activity. GECCO 2006: 1853-1854 - 2005
- [c2]Jörn Grahl, Stefan Minner, Franz Rothlauf:
Behaviour of UMDAc with truncation selection on monotonous functions. Congress on Evolutionary Computation 2005: 2553-2559 - 2004
- [c1]Jörn Grahl, Franz Rothlauf:
PolyEDA: Combining Estimation of Distribution Algorithms and Linear Inequality Constraints. GECCO (1) 2004: 1174-1185
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-05-08 21:03 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:
