历年 AAAI 最佳论文(since 1996)
AAAI 2020 投稿已经
过万,
有小伙伴说
29号投的时候才
三千多,没想到
31号就
过万了,
由此可见本次 AAAI 20220 竞争力
非常激烈了!
以下是由AI研习社整理的1996-2019年 AAAI 历年最佳论文,
感兴趣的同学可以看看,供大家学习!
我们已经准备好了
AAAI 小组,
给大家第一时间传递最新有关 AAAI 2020的消息:
想要一键下载所有论文?点击文末阅读原文闪现下载页面!
2019 | How to Combine Tree-Search Methods in ReinforcementLearning | Yonathan Efroni, Gal Dalal, Bruno Scherrer, Shie Mannor |
2018 | Memory-Augmented Monte Carlo Tree Search | Chenjun Xiao, University of Alberta; et al. |
2017 | Label-Free Supervision of Neural Networks with Physics and Domain Knowledge | Russell Stewart & Stefano Ermon, Stanford University |
2016 | Bidirectional Search That Is Guaranteed to Meet in the Middle | Robert C. Holte, University of Alberta; et al. |
2015 | From Non-Negative to General Operator Cost Partitioning | Florian Pommerening, University of Basel; et al. |
2014 | Recovering from Selection Bias in Causal and Statistical Inference | Elias Bareinboim, University of California Los Angeles; et al. |
2013 | HC-Search: Learning Heuristics and Cost Functions for Structured Prediction | Janardhan Rao Doppa, Oregon State University; et al. |
SMILe: Shuffled Multiple-Instance Learning | Gary Doran & Soumya Ray, Case Western Reserve University | |
2012 | Learning SVM Classifiers with Indefinite Kernels | Suicheng Gu & Yuhong Guo, Temple University |
Document Summarization Based on Data Reconstruction | Zhanying He, Zhejiang University; et al. | |
2011 | Dynamic Resource Allocation in Conservation Planning | Daniel Golovin, California Institute of Technology; et al. |
Complexity of and Algorithms for Borda Manipulation | Jessica Davies, University of Toronto; et al. | |
2010 | How Incomplete Is Your Semantic Web Reasoner? Systematic Analysis of the Completeness of Query Ans... | Giorgos Stoilos, Oxford University; et al. |
A Novel Transition Based Encoding Scheme for Planning as Satisfiability | Ruoyun Huang, Washington University in St. Louis; et al. | |
2008 | How Good is Almost Perfect? | Malte Helmert & Gabriele Röger, Albert-Ludwigs-Universität Freiburg |
Optimal False-Name-Proof Voting Rules with Costly Voting | Liad Wagman & Vincent Conitzer, Duke University | |
2007 | PLOW: A Collaborative Task Learning Agent | James Allen, Institute for Human and Machine Cognition; et al. |
Thresholded Rewards: Acting Optimally in Timed, Zero-Sum Games | Colin McMillen & Manuela Veloso, Carnegie Mellon University | |
2006 | Model Counting: A New Strategy for Obtaining Good Bounds | Carla P. Gomes, Cornell University; et al. |
Towards an Axiom System for Default Logic | Gerhard Lakemeyer, RWTH Aachen University Hector J. Levesque, University of Toronto | |
2005 | The Max K- Armed Bandit: A New Model of Exploration Applied to Search Heuristic Selection | Vincent A. Cicirello, Drexel University Stephen F. Smith, Carnegie Mellon University |
2004 | Learning and Inferring Transportation Routines | Lin Liao, University of Washington; et al. |
2002 | On Computing All Abductive Explanations | Thomas Eiter, Technische Universität Wien Kazuhisa Makino, Osaka University |
2000 | The Game of Hex: An Automatic Theorem-Proving Approach to Game Programming | Vadim V. Anshelevich, Vanshel Consulting |
1999 | PROVERB: The Probabilistic Cruciverbalist | Greg A. Keim, Duke University; et al. |
1998 | Learning Evaluation Functions for Global Optimization and Boolean Satisfiability | Justin A. Boyan & Andrew W. Moore, Carnegie Mellon University |
Acceleration Methods for Numeric CSPs | Yahia Lebbah & Olivier Lhomme, Ecole des Mines de Nantes | |
The Interactive Museum Tour-Guide Robot | Wolfram Burgard, University of Bonn; et al. | |
1997 | Statistical Parsing with a Context-Free Grammar and Word Statistics | Eugene Charniak, Brown University |
A Practical Algorithm for Finding Optimal Triangulations | Krill Shoikhet & Dan Geiger, Technion | |
Fast Context Switching in Real-Time Propositional Reasoning | P. Pandurang Nayak & Brian C. Williams, NASA Ames Research Center | |
Building Concept Representations from Reusable Components | Peter Clark, Boeing Bruce Porter, University of Texas at Austin | |
1996 | Verification of Knowledge Bases Based on Containment Checking | Alon Y. Levy, AT&T Laboratories Marie-Christine Rousset, Université Paris-Sud |
A Novel Application of Theory Refinement to Student Modeling | Paul T. Baffes, SciComp Raymond J. Mooney, University of Texas at Austin | |
Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search | Henry Kautz & Bart Selman, AT&T Laboratories |
点击阅读原文,一键下载所有论文
阅读原文 最新评论
推荐文章
作者最新文章
你可能感兴趣的文章
Copyright Disclaimer: The copyright of contents (including texts, images, videos and audios) posted above belong to the User who shared or the third-party website which the User shared from. If you found your copyright have been infringed, please send a DMCA takedown notice to [email protected]. For more detail of the source, please click on the button "Read Original Post" below. For other communications, please send to [email protected].
版权声明:以上内容为用户推荐收藏至CareerEngine平台,其内容(含文字、图片、视频、音频等)及知识版权均属用户或用户转发自的第三方网站,如涉嫌侵权,请通知[email protected]进行信息删除。如需查看信息来源,请点击“查看原文”。如需洽谈其它事宜,请联系[email protected]。
版权声明:以上内容为用户推荐收藏至CareerEngine平台,其内容(含文字、图片、视频、音频等)及知识版权均属用户或用户转发自的第三方网站,如涉嫌侵权,请通知[email protected]进行信息删除。如需查看信息来源,请点击“查看原文”。如需洽谈其它事宜,请联系[email protected]。