Itens para a visualização no momento 1-4 of 4

    • Binarization algorithms for approximate updating in credal nets 

      Antonucci, Alessandro; Zaffalon, Marco; Ide, Jaime S.; Cozman, Fabio G.
      2006
      Credal networks generalize Bayesian networks relaxing numerical parameters. This considerably expands expressivity. but makes belief updating a hard task even on polytrees. Nevertheless, if all the variables are binary, ...
    • Dual Dynamic Programing with cut selection: convergence proof and numerical experiments 

      Guigues, Vincent Gérard Yannick
      2017-04-01
      We consider convex optimization problems formulated using dynamic programing equations. Such problems can be solved using the Dual Dynamic Programing algorithm combined with the Level 1 cut selection strategy or the Territory ...
    • A multiple-population evolutionary approach to gate matrix layout 

      Mendes, A.; Linhares, Alexandre
      2004-01-15
      This paper deals with a Very-Large-Scale Integrated systems design problem that belongs to the NP(Nondeterministic Polynomial)-hard class. The Gate Matrix Layout problem has numerous applications in the chip-manufacturing ...
    • Run theorems for low returns and large banks 

      Bertolai, Jefferson Donizeti Pereira; Cavalcanti, Ricardo de Oliveira; Monteiro, P. K.
      2014-10
      In this paper, we revisit the issue of bank fragility in the Diamond and Dybvig (J Polit Econ 91:401-419, 1983) model with sequential service and finite traders. We provide a precise condition under which banks are susceptible ...