Buscar
Mostrando ítems 1-10 de 3834
DAE Methods in Constrained Robotics System SimulationDAE Methods in Constrained Robotics System Simulation
(Computación y Sistemas, 2009)
DAE Methods in Constrained Robotics System Simulation
(Revista Computación y Sistemas; Vol. 1 No. 3, 1998-03-09)
Abstract. In this paper a DAE formulation is used to model
the behaviour of constrained robotic systems. This
formulation allows to specify in an easy and clear way
the constrained behaviour of a robotic system.
In ...
Optimal reactive power dispatch using stochastic chance-constrained programming
(2012-11-27)
Deterministic Optimal Reactive Power Dispatch problem has been extensively studied, such that the demand power and the availability of shunt reactive power compensators are known and fixed. Give this background, a two-stage ...
Optimal reactive power dispatch using stochastic chance-constrained programming
(2012-11-27)
Deterministic Optimal Reactive Power Dispatch problem has been extensively studied, such that the demand power and the availability of shunt reactive power compensators are known and fixed. Give this background, a two-stage ...
Thermochemical equilibrium modeling of a biomass downdraft gasifier: Constrained and unconstrained non-stoichiometric models
(Elsevier B.V., 2014-07-15)
The objective of this work is to develop a non-stoichiometric equilibrium model to study parameter effects in the gasification process of a feedstock in downdraft gasifiers. The non-stoichiometric equilibrium model is also ...
Constrained and non-constrained models for site index estimation in Nothofagus antarctica forests of South PatagoniaModelos forzados y no forzados para el cálculo del índice de sitio en bosques de Nothofagus antarctica en Patagonia Sur
(Universidad Austral de Chile, Facultad de Ciencias Forestales y Recursos Naturales., 2017)
Domination Invariant of a Diameter Constrained Network Reliability Model
(UR. FI – INCO., 2004)
Let G=(V,E) be a digraph with a distinguished set of terminal vertices K in V and a vertex s in K. We define the s,K-diameter of G as the maximum distance between s and any of vertices of K. If the arcs fail randomly and ...