| Two-dimensional bandwidth minimization problem: Exact and heuristic approaches | 0 | 0.34 | 2021 |
| Solving complex problems using model transformations: from set constraint modeling to SAT instance solving | 1 | 0.36 | 2020 |
| Optimizing Smt Solving Strategies By Learning With An Evolutionary Process | 0 | 0.34 | 2018 |
| A Meta-Optimization Approach for Covering Problems in Facility Location. | 1 | 0.36 | 2017 |
| A global constraint for over-approximation of real-time streams. | 0 | 0.34 | 2017 |
| Evolving SMT Strategies | 1 | 0.38 | 2016 |
| Towards Automated Strategies in Satisfiability Modulo Theory. | 0 | 0.34 | 2016 |
| Expressively Modeling the Social Golfer Problem in SAT | 0 | 0.34 | 2015 |
| Verifying a Real-Time Language with Constraints | 2 | 0.38 | 2015 |
| Towards a Framework for Adaptive Constraint Propagation. | 0 | 0.34 | 2015 |
| Boosting autonomous search for CSPs via skylines | 8 | 0.78 | 2015 |
| Set Constraint Model and Automated Encoding into SAT: Application to the Social Golfer Problem. | 2 | 0.39 | 2014 |
| A Max-Min Ant System algorithm to solve the Software Project Scheduling Problem | 4 | 0.43 | 2014 |
| Self-adaptive Systems: Facilitating the Use of Combinatorial Problem Solvers. | 0 | 0.34 | 2014 |
| Easy Modeling of Open Pit Mining Problems via Constraint Programming. | 0 | 0.34 | 2014 |
| Modeling Manufacturing Cell Design Problems: CP vs. MH. | 2 | 0.41 | 2014 |
| A New Approach to Solve the Software Project Scheduling Problem Based on Max-Min Ant System. | 0 | 0.34 | 2014 |
| Autonomous Search: Towards the Easy Tuning of Constraint Programming Solvers. | 0 | 0.34 | 2014 |
| Modeling the Portfolio Selection Problem with Constraint Programming. | 1 | 0.43 | 2013 |
| Interleaving Constraint Propagation: An Efficient Cooperative Search with Branch and Bound. | 1 | 0.37 | 2013 |
| A hybrid AC3-tabu search algorithm for solving Sudoku puzzles | 15 | 0.96 | 2013 |
| Robust Solutions for a Robotic Manipulator Optimization Problem. | 0 | 0.34 | 2013 |
| A GUI for Modeling Regular Constraints. | 0 | 0.34 | 2013 |
| Adaptive and Multilevel Approach for Constraint Solving. | 1 | 0.37 | 2013 |
| The Role of Knowledge Management in Agile Software Development. | 0 | 0.34 | 2013 |
| Ants Can Schedule Software Projects. | 2 | 0.37 | 2013 |
| Cultural Algorithms for the Set Covering Problem. | 13 | 0.74 | 2013 |
| Cell formation in group technology using constraint programming and Boolean satisfiability | 13 | 0.67 | 2012 |
| Solving manufacturing cell design problems using constraint programming | 5 | 0.47 | 2012 |
| A Hyperheuristic Approach for Guiding Enumeration in Constraint Solving. | 4 | 0.43 | 2012 |
| Using autonomous search for generating good enumeration strategy blends in constraint programming | 20 | 0.83 | 2012 |
| Knowledge Management and Creativity Practices in Software Engineering. | 2 | 0.39 | 2012 |
| A 2-Level Metaheuristic For The Set Covering Problem | 10 | 0.56 | 2012 |
| Agile software engineering as creative work | 4 | 0.50 | 2012 |
| Extensible CP-Based Autonomous Search. | 11 | 0.79 | 2011 |
| Constraint-Based Nurse Rostering for the Valparaíso Clinic Center in Chile. | 0 | 0.34 | 2011 |
| A Framework for Autonomous Search in the Eclipse Solver. | 0 | 0.34 | 2011 |
| Adaptive hybridization strategies | 3 | 0.43 | 2011 |
| Constraint Handling Rules by Thom Frühwirth, Cambridge University Press, 2009. Hard cover: ISBN 978-0-521-87776-3. | 0 | 0.34 | 2011 |
| A hyperheuristic approach for dynamic enumeration strategy selection in constraint satisfaction | 17 | 0.81 | 2011 |
| Using a Choice Function for Guiding Enumeration in Constraint Solving | 2 | 0.48 | 2010 |
| A Choice Function to Dynamic Selection of Enumeration Strategies Solving Constraint Satisfaction Problems | 0 | 0.34 | 2009 |
| SAT Encoding and CSP Reduction for Interconnected Alldiff Constraints | 4 | 0.43 | 2009 |
| A New ACO Transition Rule for Set Partitioning and Covering Problems | 2 | 0.39 | 2009 |
| Some Results on the design of Balanced Academic Curricula | 0 | 0.34 | 2009 |
| A Theoretical Framework for Local Search Techniques | 0 | 0.34 | 2008 |
| Interleaved Alldifferent Constraints: CSP vs. SAT Approaches | 0 | 0.34 | 2008 |
| Constraint Programming Can Help Ants Solving Highly Constrainted Combinatorial Problems | 0 | 0.34 | 2008 |
| Dynamic Web Services Provisioning with Constraints | 5 | 0.46 | 2008 |
| Modelando la composición de servicios web con restricciones | 0 | 0.34 | 2008 |
