Now showing items 1-11 of 11

  • Adaptively learning probabilistic deterministic automata from data streams 

    Balle Pigem, Borja de; Castro Rabal, Jorge; Gavaldà Mestre, Ricard (2014-07)
    Article
    Restricted access - publisher's policy
    Markovian models with hidden state are widely-used formalisms for modeling sequential phenomena. Learnability of these models has been well studied when the sample is given in batch mode, and algorithms with PAC-like ...
  • Combining biased randomization with meta-heuristics for solving the multi-depot vehicle routing problem 

    Juan Pérez, Angel Alejandro; Barrios, Barry; González Martín, Sergio; Coccola, Mariana; Faulín, Javier; Bektas, Tolga (2012)
    Conference lecture
    Restricted access - publisher's policy
    This paper proposes a hybrid algorithm, combining Biased-Randomized (BR) processes with an Iterated Local Search (ILS) meta-heuristic, to solve the Multi-Depot Vehicle Routing Problem (MDVRP). Our approach assumes a ...
  • Communication requirements for team automata 

    Carmona Vargas, Josep; Beek, Maurice ter; Hennicker, Rolf; Kleijn, Jetty (Springer, 2017)
    Conference report
    Open Access
    Compatibility of components is an important issue in the quest for systems of systems that guarantee successful communications, free from message loss and indefinite waiting for inputs. In this paper, we investigate ...
  • Conditions for compatibility of components: The case of masters and slaves 

    Beek, Maurice ter; Carmona Vargas, Josep; Kleijn, Jetty (Springer, 2016)
    Conference report
    Open Access
    We consider systems composed of reactive components that collaborate through synchronised execution of common actions. These multi-component systems are formally represented as team automata, a model that allows a wide ...
  • Disseny i desenvolupament d'un model matemàtic per a la planificació de les línies de folrat d'una industria de packaging 

    Costas Morago, Enric (Universitat Politècnica de Catalunya, 2015-10)
    Master thesis
    Restricted access - confidentiality agreement
  • Learning probability distributions generated by finite-state machines 

    Castro Rabal, Jorge; Gavaldà Mestre, Ricard (Springer, 2016)
    Part of book or chapter of book
    Open Access
    We review methods for inference of probability distributions generated by probabilistic automata and related models for sequence generation. We focus on methods that can be proved to learn in the inference in the limit ...
  • Motor adaptation as a greedy optimization of error and effort 

    Emken, Jeremy L.; Benítez Iglesias, Raúl; Sideris, Athanasios; Bobrow, James E.; Reinkensmeyer, David J. (The American Physiological Society, 2007-03-31)
    Article
    Restricted access - publisher's policy
    thought of as a process in which the nervous system learns to anticipate the environmental forces to eliminate kinematic error. Here we show that motor adaptation can more generally be modeled as a process in which the ...
  • Programació de peces en màquines en paral·lel a múltiples nivells amb temps de preparació 

    Miquel Marcó, David (Universitat Politècnica de Catalunya, 2013-05)
    Master thesis (pre-Bologna period)
    Open Access
    El problema tractat en el present projecte és una variant del problema de programació del taller mecànic. En aquesta variant hi ha una disposició de les màquines en paral·lel. A més, no tots els tipus de peces es poden ...
  • Proof complexity meets algebra 

    Atserias, Albert; Ochremiak, Joanna (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017)
    Conference report
    Open Access
    We analyse how the standard reductions between constraint satisfaction problems affect their proof complexity. We show that, for the most studied propositional and semi-algebraic proof systems, the classical constructions ...
  • Revisió crítica de mecanismes de barres d'Artobolevski. 

    Carulla Solsona, Robert (Universitat Politècnica de Catalunya, 2017-06-15)
    Bachelor thesis
    Open Access
    A l'assignatura de Teoria de Màquines i Mecanismes he analitzat diversos mecanismes descrits a l'obra I.I. Artobolevski. He observat algunes inconsistències que voldria ajudar a solucionar. Per això proposo analitzar el ...
  • The HOM problem is EXPTIME-complete 

    Creus López, Carles; Gascon Caro, Adrian; Godoy Balil, Guillem; Ramos Garrido, Lander (2016)
    Article
    Open Access
    We define a new class of tree automata with constraints and prove decidability of the emptiness problem for this class in exponential time. As a consequence, we obtain several EXPTIME-completeness results for problems on ...