Loading...
Loading...

Go to the content (press return)

Sweetlogics-UPC

Total activity: 8
Type of activity
Competitive project
Funding entity
Ministerio de Ciencia e Innovación (MICINN)
Funding entity code
TIN2010-21062-C02-01
Amount
110.352,00 €
Start date
2011-01-01
End date
2015-06-30
Scope
Adm. Estat
Plan
Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica 2008-2011
Call year
2010
Funcding program
Tecnologías Informáticas
Funding call
Proyectos de investigación y acciones complementarias-TIN
Grant institution
Gobierno De España. Ministerio De Ciencia E Innovación (micinn)

Participants

Scientific and technological production

1 to 8 of 8 results
 
  • High evolutionary turnover of satellite families in Caenorhabditis  Open access

     Subirana, J.; Albà, M.; Messeguer, X.
    BMC evolutionary biology
    Vol. 15:218, p. 1-13
    DOI: 10.1186/s12862-015-0495-x
    Date of publication: 2015-10-05
    Journal article
    Loading...
    Access to the full text
  • The IntSat method for integer linear programming  Open access

     Nieuwenhuis, R.
    International Conference on Principles and Practice of Constraint Programming
    p. 574-589
    DOI: 10.1007/978-3-319-10428-7_42
    Presentation's date: 2014-09-08
    Presentation of work at congresses
    Loading...
    Access to the full text
  • Proving termination of imperative programs using Max-SMT  Open access

     Larraz, D.; Oliveras, A.; Rodriguez, E.; Rubio, A.
    International Conference on Formal Methods in Computer-Aided Design
    p. 218-225
    Presentation's date: 2013-10-23
    Presentation of work at congresses
    Loading...
    Access to the full text
  • A parametric approach for smaller and better encodings of cardinality constraints  Open access

     Abio, I.; Nieuwenhuis, R.; Oliveras, A.; Rodriguez, E.
    International Conference on Principles and Practice of Constraint Programming
    p. 80-96
    DOI: 10.1007/978-3-642-40627-0_9
    Presentation's date: 2013-09-16
    Presentation of work at congresses
    Loading...
    Access to the full text
  • To encode or to propagate? The best choice for each constraint in SAT  Open access

     Abio, I.; Nieuwenhuis, R.; Oliveras, A.; Rodriguez, E.; Stuckey, P.
    International Conference on Principles and Practice of Constraint Programming
    p. 97-106
    DOI: 10.1007/978-3-642-40627-0_10
    Presentation's date: 2013-09-16
    Presentation of work at congresses
    Loading...
    Access to the full text
  • Fun in CS2

     Duch, A.; Petit, J.; Rodriguez, E.; Roura, S.
    International Conference on Computer Supported Education
    p. 437-442
    DOI: 10.5220/0004389604370442
    Presentation's date: 2013-05-07
    Presentation of work at congresses
    Loading...
  • Nominal completion for rewrite systems with binders

     Fernandez, M.; Rubio, A.
    International Colloquium on Automata, Languages, and Programming
    p. 201-213
    DOI: 10.1007/978-3-642-31585-5_21
    Presentation's date: 2012-07-09
    Presentation of work at congresses
    Loading...
  • EasyDAS: automatic creation of DAS servers  Open access

     Gel, B.; Jenkinson, AM; Jimenez, RC; Messeguer, X.; Hermjakob, H.
    BMC bioinformatics
    Vol. 12, num. 23
    DOI: 10.1186/1471-2105-12-23
    Date of publication: 2011-01-18
    Journal article
    Loading...
    Access to the full text