default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn F. Kolen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]John Kolen:
Optimizing Dynamic Airlift Operations: Winning Strategies in the AFRL Airlift Challenge. FLAIRS 2024- 2020
- [j7]Yunqi Zhao, Igor Borovikov
, Fernando de Mesentier Silva, Ahmad Beirami, Jason Rupert, Caedmon Somers, Jesse Harder, John Kolen, Jervis Pinto, Reza Pourabolghasem, James Pestrak, Harold Chaput, Mohsen Sardari, Long Lin, Sundeep Narravula, Navid Aghdaie, Kazi A. Zaman:
Winning Is Not Everything: Enhancing Game Development With Intelligent Agents. IEEE Trans. Games 12(2): 199-212 (2020)
2010 – 2019
- 2019
- [i3]Yunqi Zhao, Igor Borovikov, Ahmad Beirami, Jason Rupert, Caedmon Somers, Jesse Harder, Fernando de Mesentier Silva, John Kolen, Jervis Pinto, Reza Pourabolghasem, Harold Chaput, James Pestrak, Mohsen Sardari, Long Lin, Navid Aghdaie, Kazi A. Zaman:
Winning Isn't Everything: Training Human-Like Agents for Playtesting and Game AI. CoRR abs/1903.10545 (2019) - 2018
- [c16]John F. Kolen, Mohsen Sardari, Marwan Mattar, Nick Peterson, Meng Wu:
Horizontal Scaling With a Framework for Providing AI Solutions Within a Game Company. AAAI 2018: 7680-7687 - [c15]Fernando de Mesentier Silva, Igor Borovikov, John Kolen, Navid Aghdaie, Kazi A. Zaman:
Exploring Gameplay With AI Agents. AIIDE 2018: 159-165 - [i2]Fernando de Mesentier Silva, Igor Borovikov, John Kolen, Navid Aghdaie, Kazi A. Zaman:
Exploring Gameplay With AI Agents. CoRR abs/1811.06962 (2018) - 2017
- [c14]Meng Wu, John Kolen, Navid Aghdaie, Kazi A. Zaman:
Recommendation Applications and Systems at Electronic Arts. RecSys 2017: 338 - [c13]Su Xue, Meng Wu, John Kolen, Navid Aghdaie, Kazi A. Zaman:
Dynamic Difficulty Adjustment for Maximized Engagement in Digital Games. WWW (Companion Volume) 2017: 465-471 - [c12]Zhengxing Chen, Su Xue, John Kolen, Navid Aghdaie, Kazi A. Zaman, Yizhou Sun, Magy Seif El-Nasr:
EOMM: An Engagement Optimized Matchmaking Framework. WWW 2017: 1143-1150 - [i1]Zhengxing Chen, Su Xue, John Kolen, Navid Aghdaie, Kazi A. Zaman, Yizhou Sun, Magy Seif El-Nasr:
EOMM: An Engagement Optimized Matchmaking Framework. CoRR abs/1702.06820 (2017)
2000 – 2009
- 2002
- [j6]John F. Kolen, Tim Hutcheson:
Reducing the time complexity of the fuzzy c-means algorithm. IEEE Trans. Fuzzy Syst. 10(2): 263-267 (2002) - [c11]John F. Kolen:
An On-Line Satisfiability Algorithm for Conjunctive Normal Form Expressions with Two Literals. FLAIRS 2002: 187-191 - 2001
- [c10]John F. Kolen, Tim Hutcheson:
A Low-Cost, High-Density Mounting System for Computer Clusters. CLUSTER 2001: 157-162 - [c9]John F. Kolen, Phillip Bruce:
Evolutionary Search for Matrix Multiplication Algorithms. FLAIRS 2001: 161-165 - [e1]Ingrid Russell, John F. Kolen:
Proceedings of the Fourteenth International Florida Artificial Intelligence Research Society Conference, May 21-23, 2001, Key West, Florida, USA. AAAI Press 2001, ISBN 1-57735-133-9 [contents] - 2000
- [c8]John F. Kolen, Rattikorn Hewett:
Prediction of lake inflows with neural networks. SMC 2000: 572-576
1990 – 1999
- 1998
- [c7]John F. Kolen, David A. Shamma, Thomas Reichherzer, Timothy Flueharty:
An AI Approach to Computer Assisted Tomography. FLAIRS 1998: 40-44 - [c6]Stefan C. Kremer, John F. Kolen:
Dynamical Recurrent Networks for Sequential Data Processing. Hybrid Neural Systems 1998: 107-122 - 1996
- [c5]John F. Kolen, Feng Zhao:
A Computatuional Analysis of the Reachability Problem for a Class of Hybrid Dynamical Systems. Hybrid Systems 1996: 215-227 - 1995
- [j5]John F. Kolen, Jordan B. Pollack:
The observers' paradox: apparent computational complexity in physical systems. J. Exp. Theor. Artif. Intell. 7(3): 253-269 (1995) - [j4]John F. Kolen, Jordan B. Pollack:
The paradox of observation and the observation of paradox. J. Exp. Theor. Artif. Intell. 7(3): 275-277 (1995) - 1994
- [j3]Edward W. Large, John F. Kolen:
Resonance and the Perception of Musical Meter. Connect. Sci. 6(2-3): 177-208 (1994) - 1993
- [c4]John F. Kolen:
Fool's Gold: Extracting Finite State Machines from Recurrent Network Dynamics. NIPS 1993: 501-508 - 1991
- [j2]John F. Kolen, Ashok K. Goel:
Learning in parallel distributed processing networks: Computational complexity and information content. IEEE Trans. Syst. Man Cybern. 21(2): 359-367 (1991) - 1990
- [j1]John F. Kolen, Jordan B. Pollack:
Backpropagation is Sensitive to Initial Conditions. Complex Syst. 4(3) (1990) - [c3]John F. Kolen, Jordan B. Pollack:
Back Propagation is Sensitive to Initial Conditions. NIPS 1990: 860-867
1980 – 1989
- 1988
- [c2]John F. Kolen:
Faster learning through a probabilistic approximation algorithm. ICNN 1988: 449-454 - 1987
- [c1]Augustus K. Uht, Constantine D. Polychronopoulos, John F. Kolen:
On the combination of hardware and software concurrency extraction methods. MICRO 1987: 133-141
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-08-30 20:43 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:
