default search action
9. SARA 2011: Parador de Cardona, Catalonia, Spain
- Michael R. Genesereth, Peter Z. Revesz:
Proceedings of the Ninth Symposium on Abstraction, Reformulation, and Approximation, SARA 2011, Parador de Cardona, Cardona, Catalonia, Spain, July 17-18, 2011. AAAI 2011, ISBN 978-1-57735-543-4 - Preface.
- Carlos Ansótegui, Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret:
Satisfiability Modulo Theories: An Efficient Approach for the Resource-Constrained Project Scheduling Problem. - Sara Bernardini, David E. Smith:
Automatic Synthesis of Temporal Invariants. - Swetha Billa, Mark A. Griep, Peter Z. Revesz:
Approximate Search on Protein Structures for Identification of Horizontal Gene Transfer in Bacteria. - Cornelia Caragea, Adrian Silvescu, Saurabh Kataria, Doina Caragea, Prasenjit Mitra:
Classifying Scientific Publications Using Abstract Features. - Laura Climent, Miguel A. Salido, Federico Barber:
Reformulating Dynamic Linear Constraint Satisfaction Problems as Weighted CSPs for Searching Robust Solutions. - Alban Grastien, Gianluca Torta:
Reformulation for the Diagnosis of Discrete-Event Systems. - Alban Grastien, Gianluca Torta:
A Theory of Abstraction for Diagnosis of Discrete-Event Systems. - Daniel Damir Harabor, Adi Botea, Philip Kilby:
Path Symmetries in Undirected Uniform-Cost Grids. - Shant Karakashian, Robert J. Woodward, Berthe Y. Choueiry:
Reformulating R(*, m)C with Tree Decomposition. - Michael Kassoff, Michael R. Genesereth:
The Markov Reformulation Theorem. - Lixin Li, Xingyou Zhang, James B. Holt, Jie Tian, Reinhard Piltner:
Spatiotemporal Interpolation Methods for Air Pollution Exposure. - Tiago Matos, Yannick Plaino Bergamo, Valdinei Freire da Silva, Fábio Gagliardi Cozman, Anna Helena Reali Costa:
Simultaneous Abstract and Concrete Reinforcement Learning. - Patricia J. Riddle, Robert C. Holte, Michael W. Barley:
Does Representation Matter in the Planning Competition? - Henry Soldano:
A Modal View on Abstract Learning and Reasoning. - Amanda Swearngin, Berthe Y. Choueiry, Eugene C. Freuder:
A Reformulation Strategy for Multi-Dimensional CSPs: The Case Study of the SET Game. - Miroslav N. Velev, Ping Gao:
Efficient Pseudo-Boolean Satisfiability Encodings for Routing and Wavelength Assignment in Optical Networks. - Miroslav N. Velev, Ping Gao:
Modular Schemes for Constructing Equivalent Boolean Encodings of Cardinality Constraints and Application to Error Diagnosis in Formal Verification of Pipelined Microprocessors. - Minlue Wang, Richard Dearden:
Planning with State Uncertainty via Contingency Planning and Execution Monitoring. - Robert J. Woodward, Shant Karakashian, Berthe Y. Choueiry, Christian Bessiere:
Reformulating the Dual Graphs of CSPs to Improve the Performance of Relational Neighborhood Inverse Consistency. - Shasha Wu, Peter Z. Revesz:
Extracting Topological Information from Spatial Constraint Databases.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.