Iván Javier Dotú Rodríguez

Becario de FPU de la EPS de Informática de la UAM.

Laboratorio B-402.

Telf. (ext) 2293.

• Docencia:

Prácticas EDI1

Prácticas MTP2

• Investigación:

  Actualmente estoy trabajando en temas de satisfacción de restricciones, optimización y planificación. Sobre todo en el desarrollo de algoritmos híbridos de búsqueda completa y búsqueda local.

   

• Thesis:

  • "Towards Hybrid Methods for Solving Hard Combiantorial Optimization Problems"

• Working Papers:

  • Carlos Cotta, Ivan Dotu, Antonio J. Fernandez and Pascal Van Hentenryck, "Local Search-Based Hybrid Algorithms for Finding Golomb Rulers", submitted to Constraints Journal.

• Publicaciones:

  • Carlos Cotta, Ivan Dotu, Antonio J. Fernandez and Pascal Van Hentenryck, "Scheduling Social Golfers with Memetic Evolutionary Programming", to appear in HM'06, October 2006.

  • Ivan Dotu and Pascal Van Hentenryck, "A Note on Low Autocorrelation Binary Sequences", in CP'06, September 2006.

  • Ivan Dotu and Pascal Van Hentenryck, "Scheduling Social Tournaments Locally", To appear in AI Communications Journal, Special Issue on Constraint Programming for Planning and Scheduling, 2006.

  • Carlos Cotta, Ivan Dotu, Antonio J. Fernandez and Pascal Van Hentenryck, "A Memetic Approach for Golomb Rulers", to appear in PPSN'06, Reykjavik, Iceland, September 2006.

  • Manuel Cebrián and Ivan Dotu, "GRASP-Evolution for Constraint Satisfaction Problems", To appear in Proceedings of  GECCO-06, Seattle, USA, July 2006.

  • Ivan Dotu, Alvaro del Val and Pascal van Hentenryck, "Scheduling Social Tournaments", In Proceedings of CP-05, Sitges, Spain.

  • Manuel Cebrián and Ivan Dotu, "A simple Hybrid GRASP-Evolutionary Algorithm for CSPs", In Proceedings of LLCS'05 Workshop in CP-05, Sitges, Spain.

  • Ivan Dotu and Pascal Van Hentenryck, “ A Simple Hybrid Evolutionary Algortihm for Finding Golomb Rulers” To appear in IEEE CEC'05 Proceedings, Edimburgh, September 2005. CEC'05

  • Ivan Dotu and Pascal Van Hentenryck, “ Scheduling Social Golfers Locally,”In CPAIOR'05 Proceedings, Prague, May 2005. CPAIOR'05

  • Carlos Ansótegui, Alvaro del Val, Iván Dotú, Cèsar Fernández y Felip Manyà, “Modeling Choices in Quasigroup Completion: SAT vs. CSP”. In AAAI'04 Proceedings, San José,California, USA, July 2004. (http://www.aaai.org).

  • Iván Dotú, Álvaro del Val and Manuel Cebrián, “Channeling Constraints and Value Ordering in the QuasiGroup Completion Problem”. In IJCAI'03 Proceedings, pages 1372-1373, Acapulco, México, August 2003. (http://www.ijcai.org).

  • Iván Dotú, Álvaro del Val and Manuel Cebrián, “Redundant Modeling for the QuasiGroup Completion Problem”. In CP'03 Proceedings, Kinsale, Ireland, September 2003. (http://www.cs.ucc.ie/cp2003/index.html).

  • Iván Dotú, Juan de Lara, “Rapid Prototyping by Means of Meta-Modelling and Graph Grammars. An Example with Constraint Satisfaction”. In Jornadas de Ingeniería del Software y Bases de Datos, JISBD’03. Alicante, Spain, November 2003, pp 401-410.

   

                

   

* This page contains links to files in Postscript (ps) or Portable Document Format (pdf) of articles which may be covered by copyright. Copying or distributing these files may violate copyright law.