default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID23rd AAAI / 20th IAAI 2008: Chicago, Illinois, USA
- Dieter Fox, Carla P. Gomes:
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17, 2008. AAAI Press 2008, ISBN 978-1-57735-368-3
Main Track Technical Papers
Agents, Game Theory, Auctions, and Mechanism Design
- Ricardo M. Araujo, Luís C. Lamb:
Memetic Networks: Analyzing the Effects of Network Properties in Multi-Agent Performance. 3-8 - Yonatan Aumann, Noam Hazon, Sarit Kraus, David Sarne:
Physical Search Problems Applying Economic Search Models. 9-16 - Michael Benisch, Norman M. Sadeh, Tuomas Sandholm:
A Theory of Expressiveness in Mechanisms. 17-23 - Yaad Blum, Jeffrey S. Rosenschein:
Multiagent Graph Coloring: Pareto Efficiency, Fairness and Individual Rationality. 24-29 - Craig Boutilier, David C. Parkes, Tuomas Sandholm, William E. Walsh:
Expressive Banner Ad Auctions and Model-Based Online Optimization for Clearing. 30-37 - Felix Brandt, Felix A. Fischer, Paul Harrenstein, Maximilian Mair:
A Computational Analysis of the Tournament Equilibrium Set. 38-43 - Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor:
Approximability of Manipulating Elections. 44-49 - Ruggiero Cavallo, David C. Parkes:
Efficient Metadeliberation Auctions. 50-56 - Steven Damer, Maria L. Gini:
Achieving Cooperation in a Minimally Constrained Environment. 57-62 - Prashant Doshi, Dennis Perez:
Generalized Point Based Value Iteration for Interactive POMDPs. 63-68 - Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge:
On the Dimensionality of Voting Games. 69-74 - Andrew Gilpin, Javier Peña, Tuomas Sandholm:
First-Order Algorithm with O(ln(1/e)) Convergence for e-Equilibrium in Two-Person Zero-Sum Games. 75-82 - Robin Glinton, Katia P. Sycara, Paul Scerri:
Agent Organized Networks Redux. 83-88 - Anthony Hunter:
Reasoning about the Appropriateness of Proponents for Arguments. 89-94 - Samuel Ieong, Yoav Shoham:
Bayesian Coalitional Games. 95-100 - Sven Koenig, Xiaoming Zheng, Craig A. Tovey, Richard B. Borie, Philip Kilby, Vangelis Markakis, Pinar Keskinocak:
Agent Coordination with Regret Clearing. 101-107 - Sébastien Lahaie, David C. Parkes, David M. Pennock:
An Expressive Auction Design for Online Display Advertising. 108-113 - Fangzhen Lin, Pingzhong Tang:
Computer-Aided Proofs of Arrow's and Other Impossibility Theorems. 114-119 - Toshihiro Matsui, Hiroshi Matsuo, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo:
Resource Constrained Distributed Constraint Optimization with Virtual Variables. 120-125 - Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosenschein:
Strategyproof Classification under Constant Hypotheses: A Tale of Two Functions. 126-131 - Martín O. Moguillansky, Nicolás D. Rotstein, Marcelo A. Falappa, Alejandro Javier García, Guillermo Ricardo Simari:
Argument Theory Change Applied to Defeasible Logic Programming. 132-137 - Steven Okamoto, Paul Scerri, Katia P. Sycara:
The Impact of Vertical Specialization on Hierarchical Multi-Agent Systems. 138-143 - Zinovi Rabinovich, Nir Pochter, Jeffrey S. Rosenschein:
Coordination and Multi-Tasking Using EMT. 144-149 - Iyad Rahwan, Kate Larson:
Pareto Optimality in Abstract Argumentation. 150-155 - Talal Rahwan, Nicholas R. Jennings:
Coalition Structure Generation: Dynamic Programming Meets Anytime Optimization. 156-161 - Sven Seuken, Ruggiero Cavallo, David C. Parkes:
Partially Synchronized DEC-MDPs in Dynamic Mechanism Design. 162-169 - Sameena Shah, Ravi Kothari, Jayadeva, Suresh Chandra:
Mathematical Modeling and Convergence Analysis of Trail Formation. 170-175 - Munindar P. Singh:
Semantical Considerations on Dialectical and Practical Commitments. 176-181 - Ioannis A. Vetsikas, Nicholas R. Jennings:
Bidding Strategies for Realistic Multi-Unit Sealed-Bid Auctions. 182-189 - Liad Wagman, Vincent Conitzer:
Optimal False-Name-Proof Voting Rules with Costly Voting. 190-195 - Lirong Xia, Vincent Conitzer:
Determining Possible and Necessary Winners under Common Voting Rules Given Partial Orders. 196-201 - Lirong Xia, Vincent Conitzer, Jérôme Lang:
Voting on Multiattribute Domains with Cyclic Preferential Dependencies. 202-207 - Haoqi Zhang, David C. Parkes:
Value-Based Policy Teaching with Active Indirect Elicitation. 208-214 - Michael Zuckerman, Piotr Faliszewski, Yoram Bachrach, Edith Elkind:
Manipulating the Quota in Weighted Voting Games. 215-220
Constraints, Satisfiability, and Search
- Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
Measuring the Hardness of SAT Instances. 222-228 - Belaid Benhamou, Mohamed Réda Saïdi:
A New Incomplete Method for CSP Inconsistency Checking. 229-234 - Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Claude-Guy Quimper, Toby Walsh:
The Parameterized Complexity of Global Constraints. 235-240 - Manuel Cebrián, Iván Dotú, Pascal Van Hentenryck, Peter Clote:
Protein Structure Prediction on the Face Centered Cubic Lattice by Local Search. 241-246 - Hai Leong Chieu, Wee Sun Lee:
Relaxed Survey Propagation: A Sum-Product Algorithm for Max-SAT. 247-252 - Martin C. Cooper, Simon de Givry, Martí Sánchez-Fibla, Thomas Schiex, Matthias Zytnicki:
Virtual Arc Consistency for Weighted CSP. 253-258 - Hilmar Finnsson, Yngvi Björnsson:
Simulation-Based Approach to General Game Playing. 259-264 - Yong Gao:
Phase Transitions and Complexity of Weighted Satisfiability and Other Intractable Parameterized Problems. 265-270 - Vibhav Gogate
, Rina Dechter:
Studies in Solution Sampling. 271-276 - Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
On Range of Skill. 277-282 - Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, Allen Van Gelder:
Clause Learning Can Effectively P-Simulate General Propositional Resolution. 283-290 - Joshua D. Isom, Sean P. Meyn, Richard D. Braatz:
Piecewise Linear Dynamic Programming for Constrained POMDPs. 291-296 - Joxan Jaffar, Andrew E. Santosa, Razvan Voicu:
Efficient Memoization for Dynamic Programming with Ad-Hoc Constraints. 297-303 - Matti Järvisalo, Tommi A. Junttila:
On the Power of Top-Down Branching Heuristics. 304-309 - Serdar Kadioglu, Meinolf Sellmann:
Efficient Context-Free Grammar Constraints. 310-316 - Richard E. Korf:
Minimizing Disk I/O in Two-Bit Breadth-First Search. 317-324 - Akshat Kumar, Adrian Petcu, Boi Faltings:
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP. 325-330 - Branislav Kveton, Jia Yuan Yu, Georgios Theocharous, Shie Mannor:
Online Learning with Expert Advice and Finite-Horizon Constraints. 331-336 - Wei Li, Pascal Poupart, Peter van Beek:
Exploiting Causal Independence Using Weighted Model Counting. 337-343 - Maxim Likhachev, Anthony Stentz:
R* Search. 344-350 - Han Lin, Kaile Su, Chu Min Li:
Within-problem Learning for Efficient Lower Bound Computation in Max-SAT Solving. 351-356 - Mehdi Samadi, Ariel Felner, Jonathan Schaeffer:
Learning from Multiple Heuristics. 357-362 - Marko Samer, Stefan Szeider:
Backdoor Trees. 363-368 - Pierre Schaus, Yves Deville:
A Global Constraint for Bin-Packing with Precedences: Application to the Assembly Line Balancing Problem. 369-374 - Pascal Van Hentenryck, Justin Yip, Carmen Gervet, Grégoire Dooms:
Bound Consistency for Binary Length-Lex Set Constraints. 375-380 - Uzi Zahavi, Ariel Felner, Neil Burch, Robert C. Holte:
Predicting the Performance of IDA* with Conditional Distributions. 381-386 - Xiaotong Zhang, Weiming Liu, Sanjiang Li, Mingsheng Ying:
Reasoning with Cardinal Directions: An Efficient Algorithm. 387-392 - Roie Zivan:
Anytime Local Search for Distributed Constraint Optimization. 393-398
Knowledge Representation, Logic, and Information Systems
- Jie Bao, George Voutsadakis, Giora Slutzki, Vasant G. Honavar:
On the Decidability of Role Mappings between Modular Ontologies. 400-405 - Chitta Baral, Jicheng Zhao:
Non-monotonic Temporal Logics that Facilitate Elaboration Tolerant Revision of Goals. 406-411 - Meghyn Bienvenu:
Prime Implicate Normal Form for ALC Concepts. 412-417 - Piero A. Bonatti, Enrico Pontelli, Tran Cao Son:
Credulous Resolution for Answer Set Programming. 418-423 - Heeyoul Choi, Seungjin Choi, Yoonsuck Choe:
Manifold Integration with Markov Random Walks. 424-429 - James P. Delgrande, Yi Jin:
Parallel Belief Revision. 430-435 - Esra Erdem, Ferhan Türe:
Efficient Haplotype Inference with Answer Set Programming. 436-441 - Hélène Fargier, Pierre Marquis:
Extending the Knowledge Compilation Map: Krom, Horn, Affine and Beyond. 442-447 - Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits:
A Meta-Programming Technique for Debugging Answer-Set Programs. 448-453 - Joseph Y. Halpern:
From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic. 454-459 - Victor Jauregui:
Nonmonotonic Modes of Inference. 460-465 - Marina Langlois, Robert H. Sloan, Balázs Szörényi, György Turán:
Horn Complements: Towards Horn-to-Horn Belief Revision. 466-471 - Joohyung Lee, Vladimir Lifschitz, Ravi Palla:
A Reductive Semantics for Counting and Choice in Answer Set Programming. 472-479 - Fangzhen Lin, Jia-Huai You:
Abductive Logic Programming by Nonground Rewrite Systems. 480-485 - Yongmei Liu:
A Formalization of Program Debugging in the Situation Calculus. 486-491 - Denis Mindolin, Jan Chomicki:
Minimal Contraction of Preference Relations. 492-497 - Leora Morgenstern:
A First-Order Theory of Stanislavskian Scene Analysis. 498-503 - Magdalena Ortiz, Mantas Simkus, Thomas Eiter:
Worst-case Optimal Conjunctive Query Answering for an Expressive Description Logic without Inverses. 504-510 - Austin Parker, Guillaume Infantes, V. S. Subrahmanian, John Grant:
An AGM-Based Belief Revision Mechanism for Probabilistic Spatio-Temporal Logics. 511-516 - Knot Pipatsrisawat, Adnan Darwiche:
New Compilation Languages Based on Structured Decomposability. 517-522 - Guilin Qi:
A Semantic Approach for Iterated Revision in Possibilistic Logic. 523-528 - Sebastian Rudolph, Markus Krötzsch, Pascal Hitzler:
Terminological Reasoning in SHIQ with Ordered Binary Decision Diagrams. 529-534 - Anika Schumann, Jinbo Huang:
A Scalable Jointree Algorithm for Diagnosability. 535-540 - Afsaneh Shirazi, Eyal Amir:
Factored Models for Probabilistic Modal Logic. 541-547 - Robyn Speer, Catherine Havasi, Henry Lieberman:
AnalogySpace: Reducing the Dimensionality of Common Sense Knowledge. 548-553 - Kaile Su, Abdul Sattar:
An Extended Interpreted System Model for Epistemic Logics. 554-559 - Miroslaw Truszczynski, Stefan Woltran:
Hyperequivalence of Logic Programs with Respect to Supported Models. 560-565 - Jun Wang, Gregory M. Provan:
Generating Application-Specific Benchmark Models for Complex Systems. 566-571 - Johan Wittocx, Maarten Mariën, Marc Denecker:
Grounding with Bounds. 572-577 - Patrick Ye, Timothy Baldwin:
Towards Automatic Animated Storyboarding. 578-583 - Jia-Huai You, Guohua Liu:
Loop Formulas for Logic Programs with Arbitrary Constraint Atoms. 584-589 - Anbu Yue, Weiru Liu:
Revising Imprecise Probabilistic Beliefs in the Framework of Probabilistic Logic Programming. 590-596
Machine Learning
- Babak Alipanahi, Michael Biggs, Ali Ghodsi:
Distance Metric Learning Versus Fisher Discriminant Analysis. 598-603 - John Asmuth, Michael L. Littman, Robert Zinkov:
Potential-based Shaping in Model-based Reinforcement Learning. 604-609 - Deng Cai, Xiaofei He, Jiawei Han:
Sparse Projections over Graph. 610-615 - Mo Chen, Jianzhuang Liu, Xiaoou Tang:
Clustering via Random Walk Hitting Time on Directed Graphs. 616-621 - Thomas G. Dietterich, Xinlong Bao:
Integrating Multiple Learning Components through Markov Logic. 622-627 - Jason Gauci, Kenneth O. Stanley:
A Case Study on the Critical Role of Geometric Regularity in Machine Learning. 628-633 - Steven C. H. Hoi, Rong Jin:
Semi-Supervised Ensemble Ranking. 634-639 - Yangqing Jia, Changshui Zhang:
Instance-level Semisupervised Multiple Instance Learning. 640-645 - Hugo Larochelle, Dumitru Erhan, Yoshua Bengio:
Zero-data Learning of New Tasks. 646-651 - Yi Liu, Xulei Wang, Hongbin Zha:
Dimension Amnesic Pyramid Match Kernel. 652-658 - Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu, Tianbing Xu:
Clustering on Complex Graphs. 659-664 - Zhiwu Lu, Yuxin Peng, Jianguo Xiao:
From Comparing Clusterings to Combining Clusterings. 665-670 - Feiping Nie, Shiming Xiang, Yangqing Jia, Changshui Zhang, Shuicheng Yan:
Trace Ratio Criterion for Feature Selection. 671-676 - Sinno Jialin Pan, James T. Kwok, Qiang Yang:
Transfer Learning via Dimensionality Reduction. 677-682 - Dan Roth, Kevin Small:
Active Learning for Pipeline Models. 683-688 - Erik G. Schultink, Ruggiero Cavallo, David C. Parkes:
Economic Hierarchical Q-Learning. 689-695 - Jianqiang Shen, Lida Li, Weng-Keen Wong:
Markov Blanket Feature Selection for Support Vector Machines. 696-701 - Neha Sugandh, Santiago Ontañón, Ashwin Ram:
On-Line Case-Based Plan Adaptation for Real-Time Strategy Games. 702-707 - Robert Van Dam, Irene Langkilde-Geary, Dan Ventura:
Adapting ADtrees for High Arity Features. 708-713 - Thomas J. Walsh, Michael L. Littman:
Efficient Learning of Action Schemas and Web-Service Descriptions. 714-719 - Fei Wang, Changshui Zhang:
On Discriminative Semi-Supervised Classification. 720-725 - Fei Wang, Tao Li, Gang Wang, Changshui Zhang:
Semi-supervised Classification Using Local and Global Regularization. 726-731 - Danny Wyatt, Tanzeem Choudhury, Jeff A. Bilmes:
Learning Hidden Curved Exponential Family Models to Infer Face-to-Face Interaction Networks from Situated Speech Data. 732-738 - Xiaofeng Yu, Wai Lam:
Hidden Dynamic Probabilistic Models for Labeling Sequence Data. 739-745 - Bin Zhang, Fei Wang, Ta-Hsin Li, Wen Jun Yin, Jin Dong:
Classification by Discriminative Regularization. 746-751 - Dan Zhang, Fei Wang, Changshui Zhang, Tao Li:
Multi-View Local Learning. 752-757 - Daoqiang Zhang, Songcan Chen, Zhi-Hua Zhou, Qiang Yang:
Constraint Projections for Ensemble Learning. 758-763
Multidisciplinary Topics and Applications
- Yolanda Gil, Varun Ratnakar:
Automating To-Do Lists for Users: Interpretation of To-Dos for Selecting and Tasking Agents. 765-771 - Benjamin Liebald, Dan Roth, Neelay Shah, Vivek Srikumar:
Proactive Intrusion Detection. 772-777 - Ian McGraw, Stephanie Seneff:
Speech-enabled Card Games for Language Learners. 778-783 - Dan Morris, Ian Simon, Sumit Basu:
Exposing Parameters of a Trained Dynamic Model for Interactive Music Creation. 784-791 - Mark J. Nelson, Michael Mateas:
Another Look at Search-Based Drama Management. 792-797 - Nathan E. Rosenblum, Xiaojin Zhu, Barton P. Miller, Karen Hunt:
Learning to Analyze Binary Computer Code. 798-804 - Jun Zhou, Li Cheng, Walter F. Bischof:
Prediction and Change Detection in Sequential Data for Interactive Applications. 805-810 - Yang Zhou, Zheng Li, Xuerui Yang, Linxia Zhang, Shireesh Srivastava, Rong Jin, Christina Chan:
Using Knowledge Driven Matrix Factorization to Reconstruct Modular Gene Regulatory Network. 811-816
Natural-Language Processing
- Chitta Baral, Juraj Dzifcak, Tran Cao Son:
Using Answer Set Programming and Lambda Calculus to Characterize Natural Language Sentences with Normatives and Exceptions. 818-823