Buscar
Mostrando ítems 61-70 de 1336
Approximate algorithms for credal networks with binary variables
(ELSEVIER SCIENCE INC, 2008)
This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contain only binary variables. Such networks can ...
Biased Random-key Genetic Algorithms For Thewinner Determination Problem In Combinatorial Auctions
(MIT PRESSCAMBRIDGE, 2015)
A hybrid method for the probabilistic maximal covering location-allocation problem
(Elsevier B.V., 2015)
A hybrid method for the probabilistic maximal covering location-allocation problem
(Elsevier B.V., 2015)
An exact conserving algorithm for nonlinear dynamics with rotational DOFs and general hyperelasticity. Part 2: shells
(SPRINGER, 2011)
Following the approach developed for rods in Part 1 of this paper (Pimenta et al. in Comput. Mech. 42:715-732, 2008), this work presents a fully conserving algorithm for the integration of the equations of motion in nonlinear ...
An exact conserving algorithm for nonlinear dynamics with rotational DOFs and general hyperelasticity. Part 1: Rods
(SPRINGER, 2008)
A fully conserving algorithm is developed in this paper for the integration of the equations of motion in nonlinear rod dynamics. The starting point is a re-parameterization of the rotation field in terms of the so-called ...
An exact bidirectional pulse algorithm for the constrained shortest path
(UniandesMaestría en Ingeniería IndustrialFacultad de IngenieríaDepartamento de Ingeniería Industrial, 2019)
"Una ruta más corta restringida es una secuencia de arcos de costo mínimo en una red dirigida que satisface las restricciones de tipo knapsack en el consumo de recursos sobre los arcos. Nosotros proponemos un método exacto ...
An exact approach to the problem of extracting an embedded network matrix
(Pergamon-elsevier Science LtdOxfordInglaterra, 2011)