Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA 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. - Ignacio Araya, Gilles Trombettoni, Bertrand Neveu:
Exploiting Monotonicity in Interval Constraint Propagation. - Gilles Audemard, George Katsirelos, Laurent Simon:
A Restriction of Extended Resolution for Clause Learning SAT Solvers. - Russell Bent, Alan Berscheid, G. Loren Toole:
Transmission Network Expansion Planning with Simulation Optimization. - Christian Bessiere, George Katsirelos, Nina Narodytska, Claude-Guy Quimper, Toby Walsh:
Propagating Conjunctions of AllDifferent Constraints. - Teresa Maria Breyer, Richard E. Korf:
Independent Additive Heuristics Reduce Search Multiplicatively. - Teresa Maria Breyer, Richard E. Korf:
1.6-Bit Pattern Databases. - Shaowei Cai, Kaile Su, Qingliang Chen:
EWLS: A New Local Search for Minimum Vertex Cover. - Patrick Eyerich, Thomas Keller, Malte Helmert:
High-Quality Policies for the Canadian Traveler's Problem. - Ariel Felner, Carsten Moldenhauer, Nathan R. Sturtevant, Jonathan Schaeffer:
Single-Frontier Bidirectional Search. - Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. - Alexandra Goultiaeva, Fahiem Bacchus:
Exploiting QBF Duality on a Circuit Representation. - Marijn Heule, Toby Walsh:
Symmetry in Solutions. - Eric Huang, Richard E. Korf:
Optimal Rectangle Packing on Non-Square Benchmarks. - Ruoyun Huang, Yixin Chen, Weixiong Zhang:
A Novel Transition Based Encoding Scheme for Planning as Satisfiability. - Tomoyuki Kaneko:
Parallel Depth First Proof Number Search. - Shant Karakashian, Robert J. Woodward, Christopher G. Reeson, Berthe Y. Choueiry, Christian Bessiere:
A First Practical Algorithm for High Levels of Relational Consistency. - Akihiro Kishimoto:
Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search. - Bradford John Larsen, Ethan Burns, Wheeler Ruml, Robert Holte:
Searching Without a Heuristic: Efficient Use of Abstraction. - Jimmy Ho-Man Lee, Ka Lun Leung:
A Stronger Consistency for Soft Global Constraints in Weighted Constraint Satisfaction. - Chu Min Li, Zhe Quan:
An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem. - Jeffrey Richard Long, Nathan R. Sturtevant, Michael Buro, Timothy Furtak:
Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search. - Yuri Malitsky, Meinolf Sellmann, Radoslaw Szymanek:
Filtering Bounded Knapsack Constraints in Expected Sublinear Time. - Alex Nash, Sven Koenig, Craig A. Tovey:
Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D. - Nir Pochter, Aviv Zohar, Jeffrey S. Rosenschein, Ariel Felner:
Search Space Reduction Using Swamp Hierarchies. - Anika Schumann, Jinbo Huang, Martin Sachenbacher:
Computing Cost-Optimal Definitely Discriminating Tests. - Bryan Silverthorn, Risto Miikkulainen:
Latent Class Models for Algorithm Portfolio Methods. - Trevor Scott Standley:
Finding Optimal Solutions to Cooperative Pathfinding Problems. - David H. Stern, Horst Samulowitz, Ralf Herbrich, Thore Graepel, Luca Pulina, Armando Tacchella:
Collaborative Expert Portfolio Management. - Roni Stern, Tamar Kulberis, Ariel Felner, Robert Holte:
Using Lookaheads with Optimal Best-First Search. - 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. - Suguru Ueda, Atsushi Iwasaki, Makoto Yokoo, Marius-Calin Silaghi, Katsutoshi Hirayama, Toshihiro Matsui:
Coalition Structure Generation based on Distributed Constraint Optimization. - Michael Veksler, Ofer Strichman:
A Proof-Producing CSP Solver. - Lin Xu, Holger H. Hoos, Kevin Leyton-Brown:
Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. - 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.
Knowledge-Based Information Systems
- Bin Cao, Dou Shen, Kuansan Wang, Qiang Yang:
Clickthrough Log Analysis by Collaborative Ranking. - Weike Pan, Evan Wei Xiang, Nathan Nan Liu, Qiang Yang:
Transfer Learning in Collaborative Filtering for Sparsity Reduction. - Vincent Wenchen Zheng, Bin Cao, Yu Zheng, Xing Xie, Qiang Yang:
Collaborative Filtering Meets Mobile Recommendation: A User-Centered Approach.
Knowledge Representation and Reasoning
- Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev:
Past and Future of DL-Lite. - Vernon Asuncion, Fangzhen Lin, Yan Zhang, Yi Zhou:
Ordered Completion for First-Order Logic Programs on Finite Structures. - Vaishak Belle, Gerhard Lakemeyer:
Reasoning about Imperfect Information Games in the Epistemic Situation Calculus. - Meghyn Bienvenu, Hélène Fargier, Pierre Marquis:
Knowledge Compilation in the Modal Logic S5. - Ronen I. Brafman, Yagil Engel:
Decomposed Utility Functions and Graphical Models for Reasoning about Preferences. - Gerhard Brewka, Miroslaw Truszczynski, Stefan Woltran:
Representing Preferences Among Sets. - Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi:
Node Selection Query Languages for Trees. - Yin Chen, Yan Zhang, Yi Zhou:
First-Order Indefinability of Answer Set Programs on Finite Structures. - Ernest Davis:
Ontologies and Representations of Matter. - Giuseppe De Giacomo, Paolo Felli, Fabio Patrizi, Sebastian Sardiña:
Two-Player Game Structures for Generalized Planning and Agent Composition. - Thomas Eiter, Wolfgang Faber, Mushthofa Mushthofa:
Space Efficient Evaluation of ASP Programs with Bounded Predicate Arities. - Joohyung Lee, Ravi Palla:
Situation Calculus as Answer Set Programming. - Jason Jingshi Li, Jochen Renz:
In Defense of Large Qualitative Calculi. - Sanjiang Li, Weiming Liu:
Topological Relations between Convex Regions. - Yongmei Liu, Bing Li:
Automated Program Debugging Via Multiple Predicate Switching. - Jianbing Ma, Weiru Liu, Salem Benferhat:
A Belief Revision Framework for Revising Epistemic States with Partial Epistemic States. - Jianbing Ma, Weiru Liu, Anthony Hunter:
Inducing Probability Distributions from Knowledge Bases with (In)dependence Relations. - Thammanit Pipatsrisawat, Adnan Darwiche:
A Lower Bound on the Size of Decomposable Negation Normal Form. - Yuan Ren, Jeff Z. Pan, Yuting Zhao:
Soundness Preserving Approximation for TBox Reasoning. - Ganesh Ram Santhanam, Samik Basu, Vasant G. Honavar:
Dominance Testing via Model Checking. - Steven Schockaert, Henri Prade:
An Inconsistency-Tolerant Approach to Information Merging Based on Proposition Relaxation. - Zhe Wang, Kewen Wang, Rodney W. Topor:
A New Approach to Knowledge Base Revision in DL-Lite. - Heng Zhang, Mingsheng Ying:
Decidable Fragments of First-Order Language Under Stable Model Semantics and Circumscription.
Machine Learning
- Saeed Amizadeh, Milos Hauskrecht:
Latent Variable Model for Learning in Pairwise Markov Networks. - 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. - Sumit Basu, Danyel Fisher, Steven Mark Drucker, Hao Lu:
Assisting Users with Clustering Tasks by Combining Metric Learning and Classification. - Will Bridewell, Ljupco Todorovski:
The Induction and Transfer of Declarative Bias. - Bin Cao, Sinno Jialin Pan, Yu Zhang, Dit-Yan Yeung, Qiang Yang:
Adaptive Transfer Learning. - Chun Chen, Zhengguang Chen, Jiajun Bu, Can Wang, Lijun Zhang, Cheng Zhang:
G-Optimal Design with Laplacian Regularization. - Shuo Chen, Jianwen Zhang, Guangyun Chen, Changshui Zhang:
What if the Irresponsible Teachers Are Dominating? - Xi Chen, Yan Liu, Han Liu, Jaime G. Carbonell:
Learning Spatial-Temporal Varying Graphs with Applications to Climate Data Analysis. - Cassio P. de Campos, Qiang Ji:
Properties of Bayesian Dirichlet Scores to Learn Bayesian Network Structures. - Eric Eaton, Gary Holness, Daniel McFarlane:
Interactive Learning Using Manifold Geometry. - Kun Gai, Changshui Zhang:
Learning Discriminative Piecewise Linear Models with Boundary Points. - Xin Geng, Kate Smith-Miles, Zhi-Hua Zhou:
Facial Age Estimation by Learning from Label Distributions. - Sepp Hartung, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
Exact Algorithms and Experiments for Hierarchical Tree Clustering. - Zhen Guo, Shenghuo Zhu, Zhongfei Zhang, Yun Chi, Yihong Gong:
A Topic Model for Linked Documents and Update Rules for its Estimation. - Yahong Han, Fei Wu, Jinzhu Jia, Yueting Zhuang, Bin Yu:
Multi-Task Sparse Discriminant Analysis (MtSDA) with Overlapping Categories. - Ran He, Bao-Gang Hu, Wei-Shi Zheng, Yanqing Guo:
Two-Stage Sparse Representation for Robust Recognition on Large-Scale Database. - Kshitij Judah, Saikat Roy, Alan Fern, Thomas G. Dietterich:
Reinforcement Learning Via Practice and Critique Advice. - Hassan Khosravi, Oliver Schulte, Tong Man, Xiaoyuan Xu, Bahareh Bina:
Structure Learning for Markov Logic Networks with Many Descriptive Attributes. - Mayank Lahiri, Manuel Cebrián:
The Genetic Algorithm as a General Diffusion Model for Social Networks. - Yu-Feng Li, James T. Kwok, Zhi-Hua Zhou:
Cost-Sensitive Semi-Supervised Support Vector Machine. - Haifeng Liu, Zhaohui Wu:
Non-Negative Matrix Factorization with Constraints. - Jialu Liu, Deng Cai, Xiaofei He:
Gaussian Mixture Model with Local Consistency. - Wei Liu, Xinmei Tian, Dacheng Tao, Jianzhuang Liu:
Constrained Metric Learning Via Distance Gap Maximization. - Yang Liu, Yan Liu, Keith C. C. Chan:
Multilinear Maximum Distance Embedding Via L1-Norm Optimization. - Marc E. Maier, Brian J. Taylor, Hüseyin Oktay, David D. Jensen:
Learning Causal Models of Relational Domains. - Yadong Mu, Shuicheng Yan:
Non-Metric Locality-Sensitive Hashing. - Michael J. Paul, Roxana Girju:
A Two-Dimensional Topic-Aspect Model for Discovering Multi-Faceted Topics. - Wei Ping, Ye Xu, Kexin Ren, Chi-Hung Chi, Shen Furao:
Non-I.I.D. Multi-Instance Dimensionality Reduction by Learning a Maximum Bag Margin Subspace. - Stefan Pintilie, Ali Ghodsi:
Conformal Mapping by Computationally Efficient Methods. - Ian Porteous, Arthur U. Asuncion, Max Welling:
Bayesian Matrix Factorization with Side Information and Dirichlet Process Mixtures. - Buyue Qian, Ian Davidson:
Semi-Supervised Dimension Reduction for Multi-Label Classification. - Bin Shen, Luo Si:
Non-Negative Matrix Factorization Clustering on Multiple Manifolds. - Yangqiu Song, Shimei Pan, Shixia Liu, Furu Wei, Michelle X. Zhou, Weihong Qian:
Constrained Coclustering for Textual Documents. - Yu-Yin Sun, Michael K. Ng, Zhi-Hua Zhou:
Multi-Instance Dimensionality Reduction. - Yu-Yin Sun, Yin Zhang, Zhi-Hua Zhou:
Multi-Label Learning with Weak Label. - Qing Tan, Qing He, Zhongzhi Shi:
Nonparametric Curve Extraction Based on Ant Colony System. - Joel Veness, Kee Siong Ng, Marcus Hutter, David Silver:
Reinforcement Learning via AIXI Approximation. - Thomas J. Walsh, Sergiu Goschin, Michael L. Littman:
Integrating Sample-Based Planning and Model-Based Reinforcement Learning. - Hua Wang, Heng Huang, Chris H. Q. Ding:
Discriminant Laplacian Embedding. - Aaron Wilson, Alan Fern, Prasad Tadepalli
:
Bayesian Policy Search for Multi-Agent Role Discovery. - Danny Wyatt, Tanzeem Choudhury, Jeff A. Bilmes:
Discovering Long Range Properties of Social Networks with Multi-Valued Time-Inhomogeneous Models. - Zenglin Xu, Rong Jin, Shenghuo Zhu, Michael R. Lyu, Irwin King:
Smooth Optimization for Effective Multiple Kernel Learning. - Makoto Yamada, Masashi Sugiyama:
Dependence Minimizing Regression with Model Selection for Non-Linear Causal Inference under Non-Gaussian Noise. - Yi Yang, Feiping Nie, Shiming Xiang, Yueting Zhuang, Wenhua Wang:
Local and Global Regressive Mapping for Manifold Learning with Out-of-Sample Extrapolation. - Jianwen Zhang, Changshui Zhang:
Multitask Bregman Clustering. - Yan-Ming Zhang, Yu Zhang, Dit-Yan Yeung, Cheng-Lin Liu, Xinwen Hou:
Transductive Learning on Adaptive Graphs. - Yi Zhang:
Multi-Task Active Learning with Output Constraints. - Zheng Zhao, Lei Wang, Huan Liu:
Efficient Spectral Feature Selection with Minimum Redundancy. - Guoqiang Zhong, Wu-Jun Li, Dit-Yan Yeung, Xinwen Hou, Cheng-Lin Liu:
Gaussian Process Latent Random Field.
Multiagent Systems
- Alon Altman, Robert Kleinberg:
Nonmanipulable Randomized Tournament Selections. - Itai Ashlagi, Moshe Tennenholtz, Aviv Zohar:
Competing Schedulers. - Yoram Bachrach, Nadja Betzler, Piotr Faliszewski:
Probabilistic Possible Winner Determination. - Yoram Bachrach, Reshef Meir, Kyomin Jung, Pushmeet Kohli:
Coalitional Structure Generation in Skill Games. - Ronen I. Brafman, Carmel Domshlak, Yagil Engel, Moshe Tennenholtz:
Transferable Utility Planning Games. - Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra:
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. - Mickey Brautbar, Michael J. Kearns, Umar Syed:
Private and Third-Party Randomization in Risk-Sensitive Equilibrium Concepts. - Andriy Burkov, Brahim Chaib-draa:
An Approximate Subgame-Perfect Equilibrium Computation Technique for Repeated Games. - Ioannis Caragiannis, Dimitris Kalaitzis, Evangelos Markakis:
Approximation Algorithms and Mechanism Design for Minimax Approval Voting. - Ioannis Caragiannis, Ariel D. Procaccia:
Voting Almost Maximizes Social Welfare Despite Limited Communication. - Archie C. Chapman, Alessandro Farinelli, Enrique Munoz de Cote, Alex Rogers, Nicholas R. Jennings:
A Distributed Algorithm for Optimising over Pure Strategy Nash Equilibria. - Yiling Chen, John K. Lai, David C. Parkes, Ariel D. Procaccia:
Truth, Justice, and Cake Cutting. - Yann Chevaleyre, Jérôme Lang, Nicolas Maudet, Jérôme Monnot:
Possible Winners when New Candidates Are Added: The Case of Scoring Rules. - Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Cloning in Elections. - Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Good Rationalizations of Voting Rules. - Umberto Grandi, Ulle Endriss:
Lifting Rationality Assumptions in Binary Aggregation. - John Grant, Sarit Kraus, Michael J. Wooldridge:
Intentions in Equilibrium. - Manish Jain, Erim Kardes, Christopher Kiekintveld, Fernando Ordóñez, Milind Tambe:
Security Games with Arbitrary Schedules: A Branch and Price Approach. - Patrick R. Jordan, Michael P. Wellman:
Algorithms for Finding Approximate Formations in Games. - Dmytro Korzhyk, Vincent Conitzer, Ronald Parr:
Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games. - Sébastien Lahaie:
Stability and Incentive Compatibility in a Kernel-Based Combinatorial Auction. - Raz Lin, Sarit Kraus, Yinon Oshrat, Ya'akov (Kobi) Gal:
Facilitating the Evaluation of Automated Negotiators using Peer Designed Agents. - Reshef Meir, Maria Polukarov, Jeffrey S. Rosenschein, Nicholas R. Jennings:
Convergence to Equilibria in Plurality Voting. - Abraham Othman, Tuomas Sandholm:
Envy Quotes and the Iterated Core-Selecting Combinatorial Auction. - Ariel D. Procaccia:
Can Approximation Circumvent Gibbard-Satterthwaite? - Amirali Salehi-Abari, Tony White:
Trust Models and Con-Man Agents: From Mathematical to Empirical Analysis. - David Sarne, Simon Shamoun, Eli Rata:
Increasing Threshold Search for Best-Valued Agents. - Travis C. Service, Julie A. Adams:
Approximate Coalition Structure Generation. - Sven Seuken, Jie Tang, David C. Parkes:
Accounting Mechanisms for Distributed Work Systems. - Ankit Sharma, Tuomas Sandholm:
Asymmetric Spite in Auctions.