default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaghuram Ramanujan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Khoi P. N. Nguyen, Raghuram Ramanujan:
Lookahead Pathology in Monte-Carlo Tree Search. ICAPS 2024: 414-422- 2023
- [c11]Haoze Wu, Christopher Hahn, Florian Lonsing, Makai Mann, Raghuram Ramanujan, Clark W. Barrett:
Lightweight Online Learning for Sets of Related Problems in Automated Reasoning. FMCAD 2023: 1-11 - [i6]Haoze Wu, Christopher Hahn, Florian Lonsing, Makai Mann, Raghuram Ramanujan, Clark W. Barrett:
Lightweight Online Learning for Sets of Related Problems in Automated Reasoning. CoRR abs/2305.11087 (2023) - 2022
- [i5]Khoi P. N. Nguyen, Raghuram Ramanujan:
Lookahead Pathology in Monte-Carlo Tree Search. CoRR abs/2212.05208 (2022) - 2021
- [i4]Braden Kronheim, Michelle P. Kuchera, Harrison B. Prosper, Raghuram Ramanujan:
Implicit Quantile Neural Networks for Jet Simulation and Correction. CoRR abs/2111.11415 (2021) - 2020
- [j1]Ryan R. Strauss
, Raghuram Ramanujan, Andrew Becker, Tabitha C. Peck:
A Steering Algorithm for Redirected Walking Using Reinforcement Learning. IEEE Trans. Vis. Comput. Graph. 26(5): 1955-1963 (2020)
2010 – 2019
- 2019
- [c10]Jiaxuan You, Haoze Wu, Clark W. Barrett, Raghuram Ramanujan, Jure Leskovec:
G2SAT: Learning to Generate SAT Formulas. NeurIPS 2019: 10552-10563 - [c9]Haoze Wu, Raghuram Ramanujan:
Learning to Generate Industrial SAT Instances. SOCS 2019: 206-207 - [i3]Jiaxuan You, Haoze Wu, Clark W. Barrett, Raghuram Ramanujan, Jure Leskovec:
G2SAT: Learning to Generate SAT Formulas. CoRR abs/1910.13445 (2019) - 2018
- [i2]Michelle P. Kuchera, Raghuram Ramanujan, Jack Z. Taylor, Ryan R. Strauss, Daniel Bazin, Joshua Bradt, Ruiming Chen:
Machine Learning Methods for Track Classification in the AT-TPC. CoRR abs/1810.10350 (2018) - 2016
- [c8]Raghuram Ramanujan:
A.I. as an Introduction to Research Methods in Computer Science. AAAI 2016: 4128-4129 - [c7]Jack Goffinet, Raghuram Ramanujan:
Monte-Carlo Tree Search for the Maximum Satisfiability Problem. CP 2016: 251-267 - 2015
- [c6]Erol Cromwell, Jonah Galeota-Sprung, Raghuram Ramanujan:
Computational Creativity in the Culinary Arts. FLAIRS 2015: 38-42 - 2012
- [b1]Raghuram Ramanujan:
Understanding Sampling-based Adversarial Search Methods. Cornell University, USA, 2012 - [i1]Raghuram Ramanujan, Ashish Sabharwal, Bart Selman:
Understanding Sampling Style Adversarial Search Methods. CoRR abs/1203.4011 (2012) - 2011
- [c5]Alessandro Previti, Raghuram Ramanujan, Marco Schaerf, Bart Selman:
Monte-Carlo Style UCT Search for Boolean Satisfiability. AI*IA 2011: 177-188 - [c4]Raghuram Ramanujan, Bart Selman:
Trade-Offs in Sampling-Based Adversarial Planning. ICAPS 2011 - [c3]Alessandro Previti, Raghuram Ramanujan, Marco Schaerf, Bart Selman:
Applying UCT to Boolean Satisfiability. SAT 2011: 373-374 - 2010
- [c2]Raghuram Ramanujan, Ashish Sabharwal, Bart Selman:
On Adversarial Search Spaces and Sampling-Based Planning. ICAPS 2010: 242-245 - [c1]Raghuram Ramanujan, Ashish Sabharwal, Bart Selman:
Understanding Sampling Style Adversarial Search Methods. UAI 2010: 474-483
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-06-04 21:28 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:
