default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24th AAAI 2010: Atlanta, Georgia, USA
- Maria Fox, David Poole:
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, Georgia, USA, July 11-15, 2010. AAAI Press 2010
Constraints, Satisfiability, and Search
- Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy:
A New Algorithm for Weighted Partial MaxSAT. 3-8 - Ignacio Araya, Gilles Trombettoni, Bertrand Neveu:
Exploiting Monotonicity in Interval Constraint Propagation. 9-14 - Gilles Audemard, George Katsirelos, Laurent Simon:
A Restriction of Extended Resolution for Clause Learning SAT Solvers. 15-20 - Russell Bent, Alan Berscheid, G. Loren Toole:
Transmission Network Expansion Planning with Simulation Optimization. 21-26 - Christian Bessiere, George Katsirelos, Nina Narodytska, Claude-Guy Quimper, Toby Walsh:
Propagating Conjunctions of AllDifferent Constraints. 27-32 - Teresa Maria Breyer, Richard E. Korf:
Independent Additive Heuristics Reduce Search Multiplicatively. 33-38 - Teresa Maria Breyer, Richard E. Korf:
1.6-Bit Pattern Databases. 39-44 - Shaowei Cai, Kaile Su, Qingliang Chen:
EWLS: A New Local Search for Minimum Vertex Cover. 45-50 - Patrick Eyerich, Thomas Keller, Malte Helmert:
High-Quality Policies for the Canadian Traveler's Problem. 51-58 - Ariel Felner, Carsten Moldenhauer, Nathan R. Sturtevant, Jonathan Schaeffer:
Single-Frontier Bidirectional Search. 59-64 - Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. 65-70 - Alexandra Goultiaeva, Fahiem Bacchus:
Exploiting QBF Duality on a Circuit Representation. 71-76 - Marijn Heule, Toby Walsh:
Symmetry in Solutions. 77-82 - Eric Huang, Richard E. Korf:
Optimal Rectangle Packing on Non-Square Benchmarks. 83-88 - Ruoyun Huang, Yixin Chen, Weixiong Zhang:
A Novel Transition Based Encoding Scheme for Planning as Satisfiability. 89-94 - Tomoyuki Kaneko:
Parallel Depth First Proof Number Search. 95-100 - Shant Karakashian, Robert J. Woodward, Christopher G. Reeson, Berthe Y. Choueiry, Christian Bessiere:
A First Practical Algorithm for High Levels of Relational Consistency. 101-107 - Akihiro Kishimoto:
Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search. 108-113 - Bradford John Larsen, Ethan Burns, Wheeler Ruml, Robert Holte:
Searching Without a Heuristic: Efficient Use of Abstraction. 114-120 - Jimmy Ho-Man Lee, Ka Lun Leung:
A Stronger Consistency for Soft Global Constraints in Weighted Constraint Satisfaction. 121-127 - Chu Min Li, Zhe Quan:
An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem. 128-133 - Jeffrey Richard Long, Nathan R. Sturtevant, Michael Buro, Timothy Furtak:
Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search. 134-140 - Yuri Malitsky, Meinolf Sellmann, Radoslaw Szymanek:
Filtering Bounded Knapsack Constraints in Expected Sublinear Time. 141-146 - Alex Nash, Sven Koenig, Craig A. Tovey:
Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D. 147-154 - Nir Pochter, Aviv Zohar, Jeffrey S. Rosenschein, Ariel Felner:
Search Space Reduction Using Swamp Hierarchies. 155-160 - Anika Schumann, Jinbo Huang, Martin Sachenbacher:
Computing Cost-Optimal Definitely Discriminating Tests. 161-166 - Bryan Silverthorn, Risto Miikkulainen:
Latent Class Models for Algorithm Portfolio Methods. 167-172 - Trevor Scott Standley:
Finding Optimal Solutions to Cooperative Pathfinding Problems. 173-178 - David H. Stern, Horst Samulowitz, Ralf Herbrich, Thore Graepel, Luca Pulina, Armando Tacchella:
Collaborative Expert Portfolio Management. 179-184 - Roni Stern, Tamar Kulberis, Ariel Felner, Robert Holte:
Using Lookaheads with Optimal Best-First Search. 185-190 - Dejian Tu, Songshan Guo, Hu Qin, Wee-Chong Oon, Andrew Lim:
The Tree Representation of Feasible Solutions for the TSP with Pickup and Delivery and LIFO Loading. 191-196 - Suguru Ueda, Atsushi Iwasaki, Makoto Yokoo, Marius-Calin Silaghi, Katsutoshi Hirayama, Toshihiro Matsui:
Coalition Structure Generation based on Distributed Constraint Optimization. 197-203 - Michael Veksler, Ofer Strichman:
A Proof-Producing CSP Solver. 204-209 - Lin Xu, Holger H. Hoos, Kevin Leyton-Brown:
Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. 210-216 - Junping Zhou, Minghao Yin, Chunguang Zhou:
New Worst-Case Upper Bound for #2-SAT and #3-SAT with the Number of Clauses as the Parameter. 217-222
Knowledge-Based Information Systems
- Bin Cao, Dou Shen, Kuansan Wang, Qiang Yang:
Clickthrough Log Analysis by Collaborative Ranking. 224-229 - Weike Pan, Evan Wei Xiang, Nathan Nan Liu, Qiang Yang:
Transfer Learning in Collaborative Filtering for Sparsity Reduction. 230-235 - Vincent Wenchen Zheng, Bin Cao, Yu Zheng, Xing Xie, Qiang Yang:
Collaborative Filtering Meets Mobile Recommendation: A User-Centered Approach. 236-241
Knowledge Representation and Reasoning
- Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev:
Past and Future of DL-Lite. 243-248 - Vernon Asuncion, Fangzhen Lin, Yan Zhang, Yi Zhou:
Ordered Completion for First-Order Logic Programs on Finite Structures. 249-254 - Vaishak Belle, Gerhard Lakemeyer:
Reasoning about Imperfect Information Games in the Epistemic Situation Calculus. 255-260 - Meghyn Bienvenu, Hélène Fargier, Pierre Marquis:
Knowledge Compilation in the Modal Logic S5. 261-266 - Ronen I. Brafman, Yagil Engel:
Decomposed Utility Functions and Graphical Models for Reasoning about Preferences. 267-272 - Gerhard Brewka, Miroslaw Truszczynski, Stefan Woltran:
Representing Preferences Among Sets. 273-278 - Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi:
Node Selection Query Languages for Trees. 279-284 - Yin Chen, Yan Zhang, Yi Zhou:
First-Order Indefinability of Answer Set Programs on Finite Structures. 285-290 - Ernest Davis:
Ontologies and Representations of Matter. 291-296 - Giuseppe De Giacomo, Paolo Felli, Fabio Patrizi, Sebastian Sardiña:
Two-Player Game Structures for Generalized Planning and Agent Composition. 297-302 - Thomas Eiter, Wolfgang Faber, Mushthofa Mushthofa:
Space Efficient Evaluation of ASP Programs with Bounded Predicate Arities. 303-308 - Joohyung Lee, Ravi Palla:
Situation Calculus as Answer Set Programming. 309-314 - Jason Jingshi Li, Jochen Renz:
In Defense of Large Qualitative Calculi. 315-320 - Sanjiang Li, Weiming Liu:
Topological Relations between Convex Regions. 321-326 - Yongmei Liu, Bing Li:
Automated Program Debugging Via Multiple Predicate Switching. 327-332 - Jianbing Ma, Weiru Liu, Salem Benferhat:
A Belief Revision Framework for Revising Epistemic States with Partial Epistemic States. 333-338 - Jianbing Ma, Weiru Liu, Anthony Hunter:
Inducing Probability Distributions from Knowledge Bases with (In)dependence Relations. 339-344 - Thammanit Pipatsrisawat, Adnan Darwiche:
A Lower Bound on the Size of Decomposable Negation Normal Form. 345-350 - Yuan Ren, Jeff Z. Pan, Yuting Zhao:
Soundness Preserving Approximation for TBox Reasoning. 351-356 - Ganesh Ram Santhanam, Samik Basu, Vasant G. Honavar:
Dominance Testing via Model Checking. 357-362 - Steven Schockaert, Henri Prade:
An Inconsistency-Tolerant Approach to Information Merging Based on Proposition Relaxation. 363-368 - Zhe Wang, Kewen Wang, Rodney W. Topor:
A New Approach to Knowledge Base Revision in DL-Lite. 369-374 - Heng Zhang, Mingsheng Ying:
Decidable Fragments of First-Order Language Under Stable Model Semantics and Circumscription. 375-380
Machine Learning
- Saeed Amizadeh, Milos Hauskrecht:
Latent Variable Model for Learning in Pairwise Markov Networks. 382-387 - Javad Azimi, Xiaoli Z. Fern, Alan Fern, Elizabeth Burrows, Frank Chaplen, Yanzhen Fan, Hong Liu, Jun Jaio, Rebecca Schaller:
Myopic Policies for Budgeted Optimization with Constrained Experiments. 388-393 - Sumit Basu, Danyel Fisher, Steven Mark Drucker, Hao Lu:
Assisting Users with Clustering Tasks by Combining Metric Learning and Classification. 394-400 - Will Bridewell, Ljupco Todorovski:
The Induction and Transfer of Declarative Bias. 401-406 - Bin Cao, Sinno Jialin Pan, Yu Zhang, Dit-Yan Yeung, Qiang Yang:
Adaptive Transfer Learning. 407-412 - Chun Chen, Zhengguang Chen, Jiajun Bu, Can Wang, Lijun Zhang, Cheng Zhang:
G-Optimal Design with Laplacian Regularization. 413-418 - Shuo Chen, Jianwen Zhang, Guangyun Chen, Changshui Zhang:
What if the Irresponsible Teachers Are Dominating? 419-424 - Xi Chen, Yan Liu, Han Liu, Jaime G. Carbonell:
Learning Spatial-Temporal Varying Graphs with Applications to Climate Data Analysis. 425-430 - Cassio P. de Campos, Qiang Ji:
Properties of Bayesian Dirichlet Scores to Learn Bayesian Network Structures. 431-436 - Eric Eaton, Gary Holness, Daniel McFarlane:
Interactive Learning Using Manifold Geometry. 437-443 - Kun Gai, Changshui Zhang:
Learning Discriminative Piecewise Linear Models with Boundary Points. 444-450 - Xin Geng, Kate Smith-Miles, Zhi-Hua Zhou:
Facial Age Estimation by Learning from Label Distributions. 451-456 - Sepp Hartung, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
Exact Algorithms and Experiments for Hierarchical Tree Clustering. 457-462 - Zhen Guo, Shenghuo Zhu, Zhongfei Zhang, Yun Chi, Yihong Gong:
A Topic Model for Linked Documents and Update Rules for its Estimation. 463-468 - Yahong Han, Fei Wu, Jinzhu Jia, Yueting Zhuang, Bin Yu:
Multi-Task Sparse Discriminant Analysis (MtSDA) with Overlapping Categories. 469-474 - Ran He, Bao-Gang Hu, Wei-Shi Zheng, Yanqing Guo:
Two-Stage Sparse Representation for Robust Recognition on Large-Scale Database. 475-480 - Kshitij Judah, Saikat Roy, Alan Fern, Thomas G. Dietterich:
Reinforcement Learning Via Practice and Critique Advice. 481-486 - Hassan Khosravi, Oliver Schulte, Tong Man, Xiaoyuan Xu, Bahareh Bina:
Structure Learning for Markov Logic Networks with Many Descriptive Attributes. 487-493 - Mayank Lahiri, Manuel Cebrián:
The Genetic Algorithm as a General Diffusion Model for Social Networks. 494-499 - Yufeng Li, James T. Kwok, Zhi-Hua Zhou:
Cost-Sensitive Semi-Supervised Support Vector Machine. 500-505 - Haifeng Liu, Zhaohui Wu:
Non-Negative Matrix Factorization with Constraints. 506-511 - Jialu Liu, Deng Cai, Xiaofei He:
Gaussian Mixture Model with Local Consistency. 512-517 - Wei Liu, Xinmei Tian, Dacheng Tao, Jianzhuang Liu:
Constrained Metric Learning Via Distance Gap Maximization. 518-524 - Yang Liu, Yan Liu, Keith C. C. Chan:
Multilinear Maximum Distance Embedding Via L1-Norm Optimization. 525-530 - Marc E. Maier, Brian J. Taylor, Hüseyin Oktay, David D. Jensen:
Learning Causal Models of Relational Domains. 531-538 - Yadong Mu, Shuicheng Yan:
Non-Metric Locality-Sensitive Hashing. 539-544 - Michael J. Paul, Roxana Girju:
A Two-Dimensional Topic-Aspect Model for Discovering Multi-Faceted Topics. 545-550 - Wei Ping, Ye Xu, Kexin Ren, Chi-Hung Chi, Furao Shen:
Non-I.I.D. Multi-Instance Dimensionality Reduction by Learning a Maximum Bag Margin Subspace. 551-556 - Stefan Pintilie, Ali Ghodsi:
Conformal Mapping by Computationally Efficient Methods. 557-562 - Ian Porteous, Arthur U. Asuncion, Max Welling:
Bayesian Matrix Factorization with Side Information and Dirichlet Process Mixtures. 563-568 - Buyue Qian, Ian Davidson:
Semi-Supervised Dimension Reduction for Multi-Label Classification. 569-574 - Bin Shen, Luo Si:
Non-Negative Matrix Factorization Clustering on Multiple Manifolds. 575-580 - Yangqiu Song, Shimei Pan, Shixia Liu, Furu Wei, Michelle X. Zhou, Weihong Qian:
Constrained Coclustering for Textual Documents. 581-586 - Yu-Yin Sun, Michael K. Ng, Zhi-Hua Zhou:
Multi-Instance Dimensionality Reduction. 587-592 - Yu-Yin Sun, Yin Zhang, Zhi-Hua Zhou:
Multi-Label Learning with Weak Label. 593-598 - Qing Tan, Qing He, Zhongzhi Shi:
Nonparametric Curve Extraction Based on Ant Colony System. 599-604 - Joel Veness, Kee Siong Ng, Marcus Hutter, David Silver:
Reinforcement Learning via AIXI Approximation. 605-611 - Thomas J. Walsh, Sergiu Goschin, Michael L. Littman:
Integrating Sample-Based Planning and Model-Based Reinforcement Learning. 612-617 - Hua Wang, Heng Huang, Chris H. Q. Ding:
Discriminant Laplacian Embedding. 618-623 - Aaron Wilson, Alan Fern, Prasad Tadepalli
:
Bayesian Policy Search for Multi-Agent Role Discovery. 624-629 - Danny Wyatt, Tanzeem Choudhury, Jeff A. Bilmes:
Discovering Long Range Properties of Social Networks with Multi-Valued Time-Inhomogeneous Models. 630-636 - Zenglin Xu, Rong Jin, Shenghuo Zhu, Michael R. Lyu, Irwin King:
Smooth Optimization for Effective Multiple Kernel Learning. 637-642 - Makoto Yamada, Masashi Sugiyama:
Dependence Minimizing Regression with Model Selection for Non-Linear Causal Inference under Non-Gaussian Noise. 643-648 - Yi Yang, Feiping Nie, Shiming Xiang, Yueting Zhuang, Wenhua Wang:
Local and Global Regressive Mapping for Manifold Learning with Out-of-Sample Extrapolation. 649-654 - Jianwen Zhang, Changshui Zhang:
Multitask Bregman Clustering. 655-660 - Yan-Ming Zhang, Yu Zhang, Dit-Yan Yeung, Cheng-Lin Liu, Xinwen Hou:
Transductive Learning on Adaptive Graphs. 661-666 - Yi Zhang:
Multi-Task Active Learning with Output Constraints. 667-672 - Zheng Zhao, Lei Wang, Huan Liu:
Efficient Spectral Feature Selection with Minimum Redundancy. 673-678 - Guoqiang Zhong, Wu-Jun Li, Dit-Yan Yeung, Xinwen Hou, Cheng-Lin Liu:
Gaussian Process Latent Random Field. 679-684
Multiagent Systems
- Alon Altman, Robert Kleinberg:
Nonmanipulable Randomized Tournament Selections. 686-690 - Itai Ashlagi, Moshe Tennenholtz, Aviv Zohar:
Competing Schedulers. 691-696 - Yoram Bachrach, Nadja Betzler, Piotr Faliszewski:
Probabilistic Possible Winner Determination. 697-702 - Yoram Bachrach, Reshef Meir, Kyomin Jung, Pushmeet Kohli:
Coalitional Structure Generation in Skill Games. 703-708 - Ronen I. Brafman, Carmel Domshlak, Yagil Engel, Moshe Tennenholtz:
Transferable Utility Planning Games. 709-714 - Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra:
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. 715-722 - Mickey Brautbar, Michael J. Kearns, Umar Syed:
Private and Third-Party Randomization in Risk-Sensitive Equilibrium Concepts. 723-728 - Andriy Burkov, Brahim Chaib-draa:
An Approximate Subgame-Perfect Equilibrium Computation Technique for Repeated Games. 729-736 - Ioannis Caragiannis, Dimitris Kalaitzis, Evangelos Markakis:
Approximation Algorithms and Mechanism Design for Minimax Approval Voting. 737-742 - Ioannis Caragiannis, Ariel D. Procaccia:
Voting Almost Maximizes Social Welfare Despite Limited Communication. 743-748 - Archie C. Chapman, Alessandro Farinelli, Enrique Munoz de Cote, Alex Rogers, Nicholas R. Jennings:
A Distributed Algorithm for Optimising over Pure Strategy Nash Equilibria. 749-755 - Yiling Chen, John K. Lai, David C. Parkes, Ariel D. Procaccia:
Truth, Justice, and Cake Cutting. 756-761 - Yann Chevaleyre, Jérôme Lang, Nicolas Maudet, Jérôme Monnot:
Possible Winners when New Candidates Are Added: The Case of Scoring Rules. 762-767 - Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Cloning in Elections. 768-773 - Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Good Rationalizations of Voting Rules. 774-779 - Umberto Grandi, Ulle Endriss:
Lifting Rationality Assumptions in Binary Aggregation. 780-785 - John Grant, Sarit Kraus, Michael J. Wooldridge:
Intentions in Equilibrium. 786-791 - Manish Jain, Erim Kardes, Christopher Kiekintveld, Fernando Ordóñez, Milind Tambe:
Security Games with Arbitrary Schedules: A Branch and Price Approach. 792-797 - Patrick R. Jordan, Michael P. Wellman:
Algorithms for Finding Approximate Formations in Games. 798-804 - Dmytro Korzhyk, Vincent Conitzer, Ronald Parr:
Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games. 805-810 - Sébastien Lahaie:
Stability and Incentive Compatibility in a Kernel-Based Combinatorial Auction. 811-816 - Raz Lin, Sarit Kraus, Yinon Oshrat, Ya'akov (Kobi) Gal:
Facilitating the Evaluation of Automated Negotiators using Peer Designed Agents. 817-822