- Synopsis of Research Agenda Carla P. Gomes
- Computers & Operations Research 36 (2009) 2376 --2386 Contents lists available at ScienceDirect
- On the Fine Structure of Large Search Spaces Carla Gomes and Bart Selman
- Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints
- Streamlined Constraint Reasoning ? Carla Gomes and Meinolf Sellmann
- Dynamic Restart Policies Henry Kautz
- Statistical Regimes Across Constrainedness CARLA P. GOMES gomes@cs.cornell.edu
- APPROXIMATION ALGORITHMS Carla P. Gomes
- Integrating Systematic and Local Search Paradigms: A New Strategy for MaxSAT
- On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search
- International Journal on Artificial Intelligence Tools Vol. 0, No. 0 (1999) 000---000
- Completing Quasigroups or Latin Squares: A Structured Graph Coloring Problem #
- Annals of Operations Research 130, 117141, 2004 2004 Kluwer Academic Publishers. Manufactured in The Netherlands.
- Constraint Programming Letters 1 (2007) 15-20 Submitted 5/2007; Published 11/2007 The Science of Constraints
- Incorporating Economic and Ecological Information into the Optimal Design of Wildlife Corridors
- RANDOMIZED BACKTRACK SEARCH Extending the reach of complete search methods
- Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
- Quality of LP-based Approximations for Highly Combinatorial Problems
- The Seven Bridges of Konigsberg In Konigsberg, Germany, a river ran through the city such
- Formal Models of HeavyTailed Behavior in Combinatorial Search #
- Backdoors to Combinatorial Optimization: Feasibility and Optimality
- Carla P. Gomes Ithaca, NY, USA
- Statistical Regimes Across Constrainedness Carla P. Gomes 1 , Cesar Fernandez 2 , Bart Selman 1 , and Christian Bessiere 3
- Proceedings CPAIOR'02 The Promise of LP to Boost CSP
- Model Counting: A New Strategy for Obtaining Good Bounds Carla P. Gomes and Ashish Sabharwal and Bart Selman
- Boosting Combinatorial Search Through Randomization Carla P. Gomes #
- HeavyTailed Distributions in Combinatorial Carla P. Gomes 1 , Bart Selman 2 , and Nuno Crato 3
- Statistical Regimes Across Constrainedness Regions # Carla P. Gomes (gomes@cs.cornell.edu)
- Quality of LPbased Approximations for Highly Combinatorial Problems #
- Tradeoffs in the Complexity of Backdoor Detection
- Dynamic Restart Policies Henry Kautz
- Intermediate articleHill-climbing Search Bart Selman, Cornell University, Ithaca, New York, USA
- The Impact of Balancing on Problem Hardness in a Highly Structured Domain Carlos Ansotegui1
- In Proceedings of CP-2002, Ithaca, New York, USA Communication and Computation
- Statistical Regimes Across Constrainedness Carla P. Gomes1
- Algorithm Portfolios Carla Gomes and Bart Selman
- Structure, Duality, and Randomization: Common Themes in AI and OR Carla P. Gomes
- Operations Research Time Line 1665 Newton's Method for Finding a Minimum Solution of a Function, I. Newton
- Handbook of Constraint Programming 639 Edited by F. Rossi, P. van Beek and T. Walsh
- Backdoors To Typical Case Complexity Ryan Williams
- Streamlined Constraint Reasoning Carla Gomes and Meinolf Sellmann
- From Sampling to Model Counting Carla P. Gomes Joerg Hoffmann Ashish Sabharwal Bart Selman
- Backdoors To Typical Case Complexity Ryan Williams
- In Proceedings of CP-2002, Ithaca, New York, USA Communication and Computation
- Handbook of Satisfiability Armin Biere, Marijn Heule, Hans van Maaren and Toby Walsch
- The Achilles' Heel of QBF Carlos Ansotegui, Carla P. Gomes, and Bart Selman
- Solving Connected Subgraph Problems in Wildlife Conservation
- Computing the Density of States of Boolean Formulas
- The Steiner Multigraph Problem: Wildlife Corridor Design for Multiple Species
- 2 AUGUST 2002 VOL 297 SCIENCE www.sciencemag.org784 mass transport in the tropical Pacific parallel
- Back in the 1950s and '60s, researchers in the in-fant field of artificial intelligence first proclaimed that
- Carla P. Gomes Computing and Information Science 154 Whitetail Dr.
- Operations Research Letters 32 (2004) 479484 www.elsevier.com/locate/dsw
- Extending the Reach of Proof Planning by Randomization and Restart Techniques
- On the Fine Structure of Large Search Spaces Carla Gomes and Bart Selman
- The Challenge of Generating Spatially Balanced Scientific Experiment Designs ?
- The Power of Semidefinite Programming Relaxations for MAXSAT
- Backdoors in the Context of Learning Bistra Dilkina Carla P. Gomes Ashish Sabharwal
- Algorithm Portfolios Carla P. Gomes # and Bart Selman
- Handbook of Knowledge Representation 89 Edited by F. van Harmelen, V. Lifschitz and B. Porter
- Journal of Automated Reasoning 24: 67100, 2000. 2000 Kluwer Academic Publishers. Printed in the Netherlands.
- Ranking Structured Documents: A Large Margin Based Approach for Patent Prior Art Search
- The Challenge of Generating Spatially Balanced Scientific Experiment Designs
- Researchers in computing, information science, and many other disciplines are working together to support
- Generating Satisfiable Problem Instances Dimitris Achlioptas
- An improved approximation algorithm for the partial latin square extension problem
- Statistical Regimes Across Constrainedness Regions Carla P. Gomes (gomes@cs.cornell.edu)
- Maximizing the Spread of Cascades Using Network Design Daniel Sheldon
- Carla P. Gomes Ithaca, NY, USA
- Synopsis of Research Agenda Carla P. Gomes
- Playing games against nature: optimal policies for renewable resource allocation
- Computational Sustainability: Computational Methods for a Sustainable Environment, Economy, and Society
- ICS ANNUAL REPORT, 2010: RESEARCH AND EDUCATION ACTIVITIES
- Communication and Computation in DCSP Algorithms
- An Empirical Study of Optimization for Maximizing Diffusion in Networks
- Connections in Networks: Hardness of Feasibility versus Optimality
- Spatially-Balanced Complete Block designs for field experiments H.M. van Es a,, C.P. Gomes b,c
- Learning Optimal Subsets with Implicit User Preferences Yunsong Guo and Carla Gomes
- Counting CSP Solutions Using Generalized XOR Constraints Carla P. Gomes and Willem-Jan van Hoeve and Ashish Sabharwal and Bart Selman
- QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency
- Artificial Intelligence 161 (2005) 117147 www.elsevier.com/locate/artint
- ARTICLE IN PRESS Available online at www.sciencedirect.com
- Completing Quasigroups or Latin Squares: A Structured Graph Coloring Problem
- Structure, Duality, and Randomization: Common Themes in AI and OR Carla P. Gomes
- Generating Satisfiable Problem Instances Dimitris Achlioptas
- Boosting Combinatorial Search Through Randomization Carla P. Gomes
- The Traveling Salesman Problem The traveling salesman problem, or TSP for short, is this
