Fotobledcuadrado.png_thumb90

Roberto Javier Asín Achá

Profesor Asistente

Universidad Técnica Federico Santa María

San Joaquín, Chile

Líneas de Investigación


Combinatorial Optimization, SAT, TIMETABLING, Automatic Algorithm Selection, Heuristic Search

Educación

  •  Ciencias de la Computación, Universidad Politécnica de Cataluña. España, 2010
  •  Ingeniería de Sistemas, Universidad Católica Boliviana. Bolivia, 2003

Experiencia Académica

  •   Profesor Asistente Full Time

    UNIVERSIDAD DE CONCEPCION

    Facultad de Ingeniería

    Concepcion, Chile

    2016 - A la fecha

  •   Profesor Asistente Full Time

    Universidad Catolica de la Santisima Concepcion

    Facultad de Ingeniería

    Concepcion, Chile

    2011 - 2016

  •   Research Assitant Full Time

    Universidad Politecnica de Cataluña

    Facultad de Informática

    Barcelona, España

    2009 - 2011

  •   Visiting Scholar (Postdoctorate) (Becas Chile de Postdoctorado) Full Time

    UNIVERSITY OF CALIFORNIA-BERKELEY

    Berkeley, Ca, Estados Unidos

    2016 - 2017

Experiencia Profesional

  •   Desarrollador Web Full Time

    Factor Ñ S.R.L

    Cochabamba, Bolivia

    2004 - 2005

  •   Profesor de computación Part Time

    Colegio San Agustín

    Cochabamba, Chile

    1998 - 2001

Difusión y Transferencia


Representante de Universidades del Directorio de las Olimpiadas Chilenas de Informática (OCI) para estudiantes de educación media (2013-actualidad)



 

Article (15)

Anytime Automatic Algorithm Selection for the Multi-Agent Path Finding Problem
Improving the state-of-the-art in the Traveling Salesman Problem: An Anytime Automatic Algorithm Selection
Multi-Agent Path Finding: A New Boolean Encoding
Anytime automatic algorithm selection for knapsack
Multipath Adaptive A*: Factors That Influence Performance in Goal-Directed Navigation in Unknown Terrain
HNCcorr: A Novel Combinatorial Approach for Cell Identification in Calcium-Imaging Movies
HNCcorr: combinatorial optimization for neuron identification
A column generation approach and new bounds for the car sequencing problem
Resizing cardinality constraints for MaxSAT
Time-Bounded Best-First Search for Reversible and Non-reversible Search Graphs
An overview of curriculum-based course timetabling
Curriculum-based course timetabling with SAT and MaxSAT
Cardinality Networks: a theoretical and empirical study
Practical algorithms for unsatisfiability proof and core generation in SAT solvers
Cardinality Networks and Their Applications

ConferencePaper (4)

Improving IntSat by expressing disjunctions of bounds as linear constraints
Reusing previously found A? paths for fast goal-directed navigation in dynamic terrain
Making A? run faster than D?-lite for path-planning in partially known terrain
Efficient Generation of Unsatisfiability Proofs and Cores in SAT

EditorialMaterial (1)

Comments on: An overview of curriculum-based course timetabling

Proyecto (2)

Distributed Sat And Maxsat For Combinatorial Optimization
Logictools2
20
Roberto Asín

Profesor Asistente

Departamento de Informática

Universidad Técnica Federico Santa María

San Joaquín, Chile

3
Jorge Baier

Profesor Asociado

Departamento de Ciencia de la Computación

Pontificia Universidad Católica de Chile

Santiago, Chile