default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID27th AAAI 2013: Bellevue, Washington, USA
- Marie desJardins, Michael L. Littman:
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA. AAAI Press 2013, ISBN 978-1-57735-615-8 - Carol Hamilton:
AAAI Organization. - Carol Hamilton:
Conference Committees. - Carol Hamilton:
Awards. - Carol Hamilton:
Sponsors. - Marie desJardins, Michael L. Littman:
AAAI-13 Preface. - Hector Muñoz-Avila, David J. Stracuzzi:
IAAI-13 Preface. - Laura E. Brown, David Kauchak:
EAAI-13 Preface. - Carol Hamilton:
Invited Talks.
Main Technical Papers
- Abhijin Adiga, Chris J. Kuhlman, Henning S. Mortveit, Anil Kumar S. Vullikanti:
Sensitivity of Diffusion Dynamics to Network Uncertainty. 2-8 - Aaron Adler, Fusun Yaman, Jacob Beal, Jeffrey Cleveland, Hala Mostafa, Annan Mozeika:
A Morphogenetically Assisted Design Variation Tool. 9-15 - Sandip Aine, Maxim Likhachev:
Truncated Incremental Search: Faster Replanning by Exploiting Suboptimality. 16-24 - Muddasser Alam, Alex Rogers, Sarvapali D. Ramchurn:
Interdependent Multi-Issue Negotiation for Energy Exchange in Remote Communities. 25-31 - Natasha Alechina, Tristan M. Behrens, Mehdi Dastani, Koen V. Hindriks, Jomi Fred Hübner, Brian Logan, Hai H. Nguyen, Marc van Zee:
Multi-Cycle Query Caching in Agent Programming. 32-38 - Noga Alon, Dvir Falik, Reshef Meir, Moshe Tennenholtz:
Bundling Attacks in Judgment Aggregation. 39-45 - Hadi Amiri, Zheng-Jun Zha, Tat-Seng Chua:
A Pattern Matching Based Model for Implicit Opinion Question Identification. 46-52 - Garrett Andersen, Vincent Conitzer:
Fast Equilibrium Computation for Infinitely Repeated Games. 53-59 - Elliot Anshelevich, Meenal Chhabra, Sanmay Das, Matthew Gerrior:
On the Social Welfare of Mechanisms for Repeated Batch Matching. 60-66 - Itai Ashlagi, Brendan Lucier, Moshe Tennenholtz:
Equilibria of Online Scheduling Algorithms. 67-73 - Haris Aziz
, Serge Gaspers, Nicholas Mattei, Nina Narodytska, Toby Walsh:
Ties Matter: Complexity of Manipulation when Tie-Breaking with a Random Vote. 74-80 - Yoram Bachrach, Pushmeet Kohli, Vladimir Kolmogorov, Morteza Zadimoghaddam:
Optimal Coalition Structure Generation in Cooperative Graph Games. 81-87 - Bikramjit Banerjee:
Pruning for Monte Carlo Distributed Reinforcement Learning in Decentralized POMDPs. 88-94 - Elias Bareinboim, Judea Pearl:
Causal Transportability with Limited Experiments. 95-101 - Samuel Barrett, Peter Stone, Sarit Kraus, Avi Rosenfeld:
Teamwork with Limited Knowledge of Teammates. 102-108 - Sumit Basu, Janara Christensen:
Teaching Classification Boundaries to Humans. 109-115 - Moshe Bitan, Ya'akov Gal, Sarit Kraus, Elad Dokow, Amos Azaria:
Social Rankings in Human-Computer Committees. 116-122 - James C. Boerkoel Jr., Edmund H. Durfee:
Decoupling the Multiagent Disjunctive Temporal Problem. 123-129 - Ronen I. Brafman, Guy Shani, Shlomo Zilberstein:
Qualitative Planning under Partial Observability in Multi-Agent Domains. 130-137 - Simina Brânzei, Ioannis Caragiannis, Jamie Morgenstern, Ariel D. Procaccia:
How Bad Is Selfish Voting? 138-144 - Shaowei Cai, Kaile Su, Chuan Luo:
Improving WalkSAT for Random k-Satisfiability Problem with k > 3. 145-151 - Nuno Cardoso, Rui Abreu:
A Kernel Density Estimate-Based Approach to Component Goodness Modeling. 152-158 - Mithun Chakraborty, Sanmay Das, Allen Lavoie, Malik Magdon-Ismail, Yonatan Naamad:
Instructor Rating Markets. 159-165 - Sibao Chen, Chris H. Q. Ding, Bin Luo, Ying Xie:
Uncorrelated Lasso. 166-172 - Wenlin Chen, Yixin Chen, Kilian Q. Weinberger, Qiang Lu, Xiaoping Chen:
Goal-Oriented Euclidean Heuristics with Manifold Learning. 173-179 - Yan Chen, Jichang Zhao, Xia Hu, Xiaoming Zhang, Zhoujun Li, Tat-Seng Chua:
From Interest to Function: Location Estimation in Social Media. 180-186 - Arthur Choi, Adnan Darwiche:
Dynamic Minimization of Sentential Decision Diagrams. 187-194 - Alessandro Cimatti, Andrea Micheli, Marco Roveri:
Timelines with Temporal Uncertainty. 195-201 - Puja Das, Nicholas Johnson, Arindam Banerjee:
Online Lazy Updates for Portfolio Selection with Transaction Costs. 202-208 - Sammy Davis-Mendelow, Jorge A. Baier, Sheila A. McIlraith:
Assumption-Based Planning: Generating Plans and Explanations under Incomplete Knowledge. 209-216 - Cassio Polpo de Campos, Fábio Gagliardi Cozman:
Complexity of Inferences in Polytree-shaped Semi-Qualitative Probabilistic Networks. 217-223 - Ronald de Haan, Anna Roubícková, Stefan Szeider:
Parameterized Complexity Results for Plan Reuse. 224-231 - Wenkui Ding, Tao Qin, Xu-Dong Zhang, Tie-Yan Liu:
Multi-Armed Bandit with Budget Constraint and Variable Costs. 232-238 - Li Dong, Furu Wei, Yajuan Duan, Xiaohua Liu, Ming Zhou, Ke Xu:
The Automated Acquisition of Suggestions from Tweets. 239-245 - Mingzhi Dong, Liang Yin, Weihong Deng, Li Shang, Jun Guo, Honggang Zhang:
A Maximum K-Min Approach for Classification. 246-252 - Janardhan Rao Doppa, Alan Fern, Prasad Tadepalli:
HC-Search: Learning Heuristics and Cost Functions for Structured Prediction. 253-259 - Gary Doran, Soumya Ray:
SMILe: Shuffled Multiple-Instance Learning. 260-266 - Thomas Eiter, Michael Fink, Thomas Krennwallner, Christoph Redl:
Liberal Safety for Answer Set Programs with External Sources. 267-275 - Yagil Engel, Moshe Tennenholtz:
Posted Prices Exchange for Display Advertising Contracts. 276-282 - Gábor Erdélyi, Martin Lackner, Andreas Pfandler:
Computational Aspects of Nearly Single-Peaked Electorates. 283-289 - Esra Erdem, Doga Gizem Kisa, Umut Öztok, Peter Schüller:
A General Formal Framework for Pathfinding Problems with Multiple Agents. 290-296 - Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran:
Abstract Preference Frameworks - a Unifying Perspective on Separability and Strong Equivalence. 297-303 - Liangda Fang, Yongmei Liu:
Multiagent Knowledge and Belief Change in the Situation Calculus. 304-312 - Uriel Feige, Gil Kalai, Moshe Tennenholtz:
The Cascade Auction - A Mechanism for Deterring Collusion in Auctions. 313-319 - Johannes Klaus Fichte, Stefan Szeider:
Backdoors to Normality for Disjunctive Logic Programs. 320-327 - Lisa Gandy, Nadji Allan, Mark Atallah, Ophir Frieder, Newton Howard, Sergey Kanareykin, Moshe Koppel, Mark Last, Yair Neuman, Shlomo Argamon:
Automatic Identification of Conceptual Metaphors With Limited Knowledge. 328-334 - Nicola Gatti, Fabio Panozzo, Marcello Restelli:
Efficient Evolutionary Dynamics with Extensive-Form Games. 335-341 - Nicola Gatti, Marco Rocco, Tuomas Sandholm:
Algorithms for Strong Nash Equilibrium with More than Two Agents. 342-349 - Martin Gebser, Benjamin Kaufmann, Javier Romero, Ramón Otero, Torsten Schaub, Philipp Wanko:
Domain-Specific Heuristics in Answer Set Programming. 350-356 - Reza Shoja Ghiass, Ognjen Arandjelovic, Hakim Bendada, Xavier Maldague:
Vesselness Features and the Inverse Compositional AAM for Robust Face Recognition Using Thermal IR. 357-364 - Debarghya Ghoshdastidar, Ambedkar Dukkipati:
On Power-Law Kernels, Corresponding Reproducing Kernel Hilbert Space and Applications. 365-371 - Sean Gilpin, Siegfried Nijssen, Ian N. Davidson:
Formalizing Hierarchical Clustering as Integer Linear Programming. 372-378 - Benjamin Nathan Grosof, Terrance Swift:
Radial Restraint: A Semantically Clean Approach to Bounded Rationality for Logic Programs. 379-386 - Yuhong Guo:
Convex Subspace Representation Learning from Multi-View Data. 387-393 - Fabian Hadiji, Kristian Kersting:
Reduce and Re-Lift: Bootstrapped Lifted Likelihood Maximization for MAP. 394-400 - Chen Hajaj, Noam Hazon, David Sarne, Avshalom Elmalech:
Search More, Disclose Less. 401-408 - Matthew Hatem, Wheeler Ruml:
External Memory Best-First Search for Multiple Sequence Alignment. 409-416 - Edward Hsiao, Martial Hebert:
Gradient Networks: Explicit Shape Matching Without Extracting Edges. 417-423 - Jin Huang, Feiping Nie, Heng Huang:
Robust Discrete Matrix Completion. 424-430 - Jin Huang, Feiping Nie, Heng Huang:
Spectral Rotation versus K-Means in Spectral Clustering. 431-437 - Jin Huang, Feiping Nie, Heng Huang, Chris H. Q. Ding:
Supervised and Projected Sparse Coding for Image Classification. 438-444 - Tomoharu Iwata, Tsutomu Hirao, Naonori Ueda:
Unsupervised Cluster Matching via Probabilistic Latent Variable Models. 445-451 - Thomas Kalinowski, Nina Narodytska, Toby Walsh, Lirong Xia:
Strategic Behavior when Allocating Indivisible Goods Sequentially. 452-458 - Iyad A. Kanj, Stefan Szeider:
On the Subexponential Time Complexity of CSP. 459-465 - Shant Karakashian, Robert J. Woodward, Berthe Y. Choueiry:
Improving the Performance of Consistency Algorithms by Localizing and Bolstering Propagation in a Tree Decomposition. 466-473 - Erez Karpas, Tomer Sagi, Carmel Domshlak, Avigdor Gal, Avi Mendelson, Moshe Tennenholtz:
Data-Parallel Computing Meets STRIPS. 474-480 - George Katsirelos, Ashish Sabharwal, Horst Samulowitz, Laurent Simon:
Resolution and Parallelizability: Barriers to the Efficient Parallelization of SAT Solvers. 481-488 - Michael Katz, Jörg Hoffmann, Carmel Domshlak:
Red-Black Relaxed Plan Heuristics. 489-495 - Aram Kawewong, Rapeeporn Pimup, Osamu Hasegawa:
Incremental Learning Framework for Indoor Scene Recognition. 496-502 - Koosha Khalvati, Alan K. Mackworth:
A Fast Pairwise Heuristic for Planning under Uncertainty. 503-509 - Doo Soon Kim, Kunal Verma, Peter Z. Yeh:
Joint Extraction and Labeling via Graph Propagation for Dictionary Construction. 510-517 - Kye-Hyeon Kim, Seungjin Choi:
Walking on Minimax Paths for k-NN Search. 518-525 - Suin Kim, Jianwen Zhang, Zheng Chen, Alice Oh, Shixia Liu:
A Hierarchical Aspect-Sentiment Model for Online Reviews. 526-533 - Egor V. Kostylev, Juan L. Reutter:
Answering Counting Aggregate Queries over Ontologies of the DL-Lite Family. 534-540 - Niveda Krishnamoorthy, Girish Malkarnenkar, Raymond J. Mooney, Kate Saenko, Sergio Guadarrama:
Generating Natural-Language Video Descriptions Using Text-Mined Knowledge. 541-547 - T. K. Satish Kumar, Marcello Cirillo, Sven Koenig:
Simple Temporal Problems with Taboo Regions. 548-554 - David Kurokawa, John K. Lai, Ariel D. Procaccia:
How to Cut a Cake Before the Party Ends. 555-561 - Shay Kutten, Ron Lavi, Amitabh Trehan:
Composition Games for Distributed Systems: The EU Grant Games. 562-568 - Branislav Kveton, Georgios Theocharous:
Structured Kernel-Based Reinforcement Learning. 569-575 - Christophe Lecoutre, Anastasia Paparrizou, Kostas Stergiou:
Extending STR to a Higher-Order Consistency. 576-582 - Sanghack Lee, Vasant G. Honavar:
m-Transportability: Transportability of a Causal Effect from Multiple Environments. 583-590 - Joshua Letchford, Vincent Conitzer:
Solving Security Games on Graphs via Marginal Probabilities. 591-597 - Boyang Li, Stephen Lee-Urban, George Johnston, Mark O. Riedl:
Story Generation with Crowdsourced Plot Graphs. 598-604 - Peng Li, Yang Liu, Maosong Sun:
An Extended GHKM Algorithm for Inducing Lambda-SCFG. 605-611 - Sebastian Link:
Reasoning about Saturated Conditional Independence Under Uncertainty: Axioms, Algorithms, and Levesque's Situations to the Rescue. 612-618 - Dehua Liu, Bojun Tu, Hui Qian, Zhihua Zhang:
Large-Scale Hierarchical Classification via Stochastic Perceptron. 619-625 - Xianglong Liu, Junfeng He, Bo Lang:
Reciprocal Hash Tables for Nearest Neighbor Search. 626-632 - Yen-Cheng Lu, Feng Chen, Yang Chen, Chang-Tien Lu:
A Generalized Student-t Based Approach to Mixed-Type Anomaly Detection. 633-639 - Zhiwu Lu, Yuxin Peng:
Unified Constraint Propagation on Multi-View Data. 640-646 - Yong Luo, Dacheng Tao, Chang Xu, Dongchen Li, Chao Xu:
Vector-Valued Multi-View Semi-Supervsed Learning for Multi-Label Image Classification. 647-653 - Sridhar Mahadevan, Stephen Giguere, Nicholas Jacek:
Basis Adaptation for Sparse Nonlinear Reinforcement Learning. 654-660 - Mehdi Hafezi Manshadi, Daniel Gildea, James F. Allen:
Integrating Programming by Example and Natural Language Programming. 661-667 - Alberto Maran, Nicolas Maudet, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable:
A Framework for Aggregating Influenced CP-Nets and its Resistance to Bribery. 668-674 - Parisa Mazrooei, Christopher Archibald, Michael Bowling:
Automating Collusion Detection in Sequential Games. 675-682 - Reshef Meir, Tyler Lu, Moshe Tennenholtz, Craig Boutilier:
On the Value of Using Group Discounts under Price Competition. 683-689 - Reshef Meir, Yair Zick, Edith Elkind, Jeffrey S. Rosenschein:
Bounding the Cost of Stability in Games over Interaction Networks. 690-696 - Felipe Meneguzzi, Pankaj R. Telang, Munindar P. Singh:
A First-Order Formalization of Commitments and Goals for Planning. 697-703 - Deyu Meng, Zongben Xu, Lei Zhang, Ji Zhao:
A Cyclic Weighted Median Method for L1 Low-Rank Matrix Factorization with Missing Entries. 704-710 - Mitra Mohtarami, Man Lan, Chew Lim Tan:
From Semantic to Emotional Space in Probabilistic Sense Sentiment Analysis. 711-717 - Thanh Hong Nguyen, Rong Yang, Amos Azaria, Sarit Kraus, Milind Tambe:
Analyzing the Effectiveness of Adversary Modeling in Security Games. 718-724 - Mathias Niepert:
Symmetry-Aware Marginal Density Estimation. 725-731 - Raz Nissim, Ronen I. Brafman:
Cost-Optimal Planning by Self-Interested Agents. 732-738 - Jan Noessner, Mathias Niepert, Heiner Stuckenschmidt:
RockIt: Exploiting Parallelism and Symmetry for MAP Inference in Statistical Relational Models. 739-745 - Sylvie C. W. Ong, Yuri Grinberg, Joelle Pineau:
Mixed Observability Predictive State Representations. 746-752 - Aditya Pal, Nilesh N. Dalvi, Kedar Bellare:
Discovering Hierarchical Structure for Sources and Entities. 753-759 - Yan Pan, Hanjiang Lai, Cong Liu, Yong Tang, Shuicheng Yan:
Rank Aggregation via Low-Rank and Structured-Sparse Decomposition. 760-766 - David C. Parkes, Ariel D. Procaccia:
Dynamic Social Choice with Evolving Preferences. 767-773 - Jason Pazis, Ronald Parr:
PAC Optimal Exploration in Continuous Space Markov Decision Processes. 774-781 - Jason Pazis, Ronald Parr:
Sample Complexity and Performance Bounds for Non-Parametric Approximate Linear Programming. 782-788 - Noam Peled, Ya'akov (Kobi) Gal, Sarit Kraus:
An Agent Design for Repeated Negotiation and Information Revelation with People. 789-795 - Houwen Peng, Bing Li, Rongrong Ji, Weiming Hu, Weihua Xiong, Congyan Lang:
Salient Object Detection via Low-Rank and Structured Sparse Matrix Decomposition. 796-802 - Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable:
Bribery in Voting With Soft Constraints. 803-809 - Denis K. Ponomaryov, Mikhail Soutchanski:
Progression of Decomposed Situation Calculus Theories. 810-817 - Alessandro Previti, João Marques-Silva:
Partial MUS Enumeration. 818-825 - Scott Proper, Kagan Tumer:
Multiagent Learning with a Noisy Global Reward Signal. 826-832 - Goran Radanovic, Boi Faltings:
A Robust Bayesian Truth Serum for Non-Binary Signals. 833-839 - Kosta Ristovski, Vladan Radosavljevic, Slobodan Vucetic, Zoran Obradovic:
Continuous Conditional Random Fields for Efficient Regression in Large Fully Connected Graphs. 840-846 - Igor Rochlin, David Sarne:
Information Sharing Under Costly Communication in Joint Exploration. 847-853 - Pierre Roy, François Pachet:
Enforcing Meter in Finite-Length Markov Sequences. 854-861