Bienvenidos al Repositorio Digital de la UPF

El repositorio institucional recoge, difunde y preserva la producción intelectual en formato digital que resulta de la actividad académica e investigadora de la UPF, las revistas científicas y las publicaciones institucionales. Su finalidad es contribuir a aumentar el impacto de la investigación hecha en la UPF y preservar la memoria intelectual de la UPF.

Comunidades

Añadido Recientemente

  • Carvalho, Catarina; Dalmau, Víctor; Krokhin, Andrei (Elsevier, 2010)
    We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of homomorphism dualities involving trees of ...
  • Oller Font, Carmen (2018)
    Aquest treball es compon de dues traduccions del català a l’anglès del primer capítol de la novel·la juvenil L’enigma Perucho, escrita per Jordi Cervera Nogués. La primera traducció és en el mateix mode de novel·la, escrita ...
  • Bulatov, Andrei A.; Dalmau, Víctor (Elsevier, 2007)
    The Counting Constraint Satisfaction Problem (#CSP) can be expressed as follows: given a set of variables, a set of values that can be taken by the variables, and a set of constraints specifying some restrictions on the ...
  • Bulatov, Andrei; Chen, Hubie; Dalmau, Víctor (Elsevier, 2007)
    Intersection-closed classes of concepts arise naturally in many contexts and have been intensively studied in computational learning theory. In this paper, we study intersection-closed classes that contain the concepts ...
  • Bonet, Blai; Geffner, Héctor (Elsevier, 2001)
    In the AIPS98 Planning Contest, the hsp planner showed that heuristic search planners can be competitive with state-of-the-art Graphplan and sat planners. Heuristic search planners like hsp transform planning problems into ...

Más