#### Filter Results:

- Full text PDF available (69)

#### Publication Year

2005

2017

- This year (7)
- Last 5 years (168)
- Last 10 years (217)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- B. Crawford, M. Aranda, C. Castro, E. Monfroy
- 2008 Third International Conference on…
- 2008

In constraint programming, enumeration strategies are crucial for resolution performances. In this work, we model the known NP-complete problems Latin Square, Magic Square and Sudoku as a constraint satisfaction problems. We solve them with constraint programming comparing the performance of different variable and value selection heuristics in its… (More)

- Broderick Crawford, Carlos Castro
- ICAISC
- 2006

Set Covering Problems and Set Partitioning Problems can model several real life situations. In this paper, we solve some benchmarks of them with Ant Colony Optimization algorithms and some hybridizations of Ant Colony Optimization with Constraint Programming techniques. A lookahead mechanism allows the incorporation of information on the anticipated… (More)

Set covering problem is the model for many important industrial applications. In this paper, we solve some benchmarks of this problem with ant colony optimization algorithms using a new transition rule. A look-ahead mechanism was incorporated to check constraint consistency in ant computing. Computational results are presented showing the advantages to use… (More)

- Broderick Crawford, Ricardo Soto, Eric Monfroy, Wenceslao Palma, Carlos Castro, Fernando Paredes
- Expert Syst. Appl.
- 2013

A Constraint Satisfaction Problem is defined by a set of variables and a set of constraints, each variable has a nonempty domain of possible values. Each constraint involves some subset of the variables and specifies the allowable combinations of values for that subset. A solution of the problem is defined by an assignment of values to some or all of the… (More)

- Eric Monfroy, Carlos Castro, Broderick Crawford
- ADVIS
- 2006

- Broderick Crawford, Ricardo Soto, Carlos Castro, Eric Monfroy
- IWINAC
- 2011

- Broderick Crawford, Carlos Castro, Eric Monfroy
- ADVIS
- 2006

- Broderick Crawford, Carlos Castro, Eric Monfroy
- 2010 Ninth Mexican International Conference on…
- 2010

In Constraint Programming, selection of a variable and a value of its domain enumeration strategies are crucial for resolution performances. We propose to use a Choice Function for guiding enumeration: we exploit search process features to dynamically adapt a Constraint Programming solver in order to more efficiently solve Constraint Satisfaction Problems.… (More)

- B. Crawford, C. L. de la Barra, R. Soto, E. Monfroy
- 2012 Workshop on Engineering Applications
- 2012

An increasing number of organizations are trending to teams for innovation and creativity. In Software Engineering it is the same, in the last years the traditional perspective on software development is changing and Agile methods have received considerable attention. Among other attributes, the agilists claim that fostering Creativity is one of the keys to… (More)