The following pages link to Carla P. Gomes (Q456408):
Displaying 43 items.
- (Q197134) (redirect page) (← links)
- (Q1010291) (redirect page) (← links)
- Wildlife corridors as a connected subgraph problem (Q456412) (← links)
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- An improved approximation algorithm for the partial Latin square extension problem. (Q703265) (← links)
- Statistical regimes across constrainedness regions (Q850446) (← links)
- A generative power-law search tree model (Q1010292) (← links)
- An efficient relaxed projection method for constrained non-negative matrix factorization with application to the phase-mapping problem in materials science (Q1626704) (← links)
- Boosting efficiency for computing the Pareto frontier on tree structured networks (Q1626740) (← links)
- Approximations and randomization to boost CSP techniques (Q1876531) (← links)
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems (Q1977752) (← links)
- In search of balance: the challenge of generating balanced Latin rectangles (Q2011576) (← links)
- Relaxation methods for constrained matrix factorization problems: solving the phase mapping problem in materials discovery (Q2011581) (← links)
- Efficient projection algorithms onto the weighted \(\ell_1\) ball (Q2124458) (← links)
- Sensor networks and distributed CSP: communication, computation and complexity (Q2457701) (← links)
- Regular-SAT: A many-valued approach to solving combinatorial problems (Q2643307) (← links)
- (Q2741510) (← links)
- (Q2741540) (← links)
- (Q2741541) (← links)
- (Q2749853) (← links)
- Upgrading Shortest Paths in Networks (Q3003277) (← links)
- Tradeoffs in the Complexity of Backdoor Detection (Q3523063) (← links)
- Solving Connected Subgraph Problems in Wildlife Conservation (Q3569923) (← links)
- Connections in Networks: Hardness of Feasibility Versus Optimality (Q3612404) (← links)
- Short XORs for Model Counting: From Theory to Practice (Q3612459) (← links)
- Backdoors to Combinatorial Optimization: Feasibility and Optimality (Q3630152) (← links)
- Backdoors in the Context of Learning (Q3637159) (← links)
- (Q4460805) (← links)
- (Q4475627) (← links)
- (Q4475647) (← links)
- (Q4667442) (← links)
- On the Erdős Discrepancy Problem (Q5265097) (← links)
- Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning (Q5310682) (← links)
- Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability (Q5326467) (← links)
- (Q5710226) (← links)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5713891) (← links)
- (Q5740444) (← links)
- QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency (Q5756570) (← links)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5898782) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900283) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900299) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900306) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900319) (← links)
- Algorithm portfolios (Q5940819) (← links)
