default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSusumu Katayama
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j3]Susumu Katayama:
Computable Variants of AIXI which are More Powerful than AIXItl. J. Artif. Gen. Intell. 10(1): 1-23 (2019)- [c13]Lidia Contreras Ochando
, Cèsar Ferri, José Hernández-Orallo, Fernando Martínez-Plumed, María José Ramírez-Quintana, Susumu Katayama:
Automated Data Transformation with Inductive Programming and Dynamic Background Knowledge. ECML/PKDD (3) 2019: 735-751 - [c12]Lidia Contreras Ochando, César Ferri, José Hernández-Orallo, Fernando Martínez-Plumed, María José Ramírez-Quintana, Susumu Katayama:
BK-ADAPT: Dynamic Background Knowledge for Automating Data Transformation. ECML/PKDD (3) 2019: 755-759 - 2018
- [i2]Susumu Katayama:
Computable Variants of AIXI which are More Powerful than AIXItl. CoRR abs/1805.08592 (2018) - [i1]Lidia Contreras Ochando, Cèsar Ferri, José Hernández-Orallo, Fernando Martínez-Plumed, María José Ramírez-Quintana, Susumu Katayama:
General-purpose Declarative Inductive Programming with Domain-Specific Background Knowledge for Data Wrangling Automation. CoRR abs/1809.10054 (2018) - 2016
- [c11]Susumu Katayama:
Ideas for a Reinforcement Learning Algorithm that Learns Programs. AGI 2016: 354-362 - 2015
- [c10]Susumu Katayama:
Towards Human-Level Inductive Functional Programming. AGI 2015: 111-120 - 2012
- [c9]Susumu Katayama:
An analytical inductive functional programming system that avoids unintended programs. PEPM 2012: 43-52 - 2011
- [c8]Susumu Katayama:
An Analytical Inductive Functional Programming System that Avoids Unintended Programs. AAIP 2011: 49-61 - [c7]Susumu Katayama:
MagicHaskeller: System demonstration. AAIP 2011: 63-70
2000 – 2009
- 2009
- [c6]Susumu Katayama:
Recent Improvements of MagicHaskeller. AAIP 2009: 174-193 - 2008
- [c5]Susumu Katayama:
Efficient Exhaustive Generation of Functional Programs Using Monte-Carlo Search with Iterative Deepening. PRICAI 2008: 199-210 - 2007
- [j2]Hiroshi Furutani, Susumu Katayama, Makoto Sakamoto, Takao Ito:
Stochastic analysis of schema distribution in a multiplicative landscape. Artif. Life Robotics 11(1): 101-104 (2007) - 2006
- [j1]Makoto Saito, Makoto Sakamoto, Youichirou Nakama, Takao Ito, Katsushi Inoue, Hiroshi Furutani, Susumu Katayama:
Some properties of four-dimensional multicounter automata. Artif. Life Robotics 10(2): 166-170 (2006) - 2005
- [c4]Hiroshi Furutani, Makoto Sakamoto, Susumu Katayama:
Influence of Finite Population Size - Extinction of Favorable Schemata. ICNC (2) 2005: 1025-1034 - [c3]Susumu Katayama:
Systematic search for lambda expressions. Trends in Functional Programming 2005: 111-126 - 2004
- [c2]Susumu Katayama:
Power of Brute-Force Search in Strongly-Typed Inductive Functional Programming Automation. PRICAI 2004: 75-84 - 2000
- [c1]Susumu Katayama, Hajime Kimura, Shigenobu Kobayashi:
A Universal Generalization for Temporal-Difference Learning Using Haar Basis Functions. ICML 2000: 447-454
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-24 23: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:
