نتایج جستجو برای: dynamic network simplex algorithm

تعداد نتایج: 1646976  

Journal: :Computers & Education 2010
Eva Millán Tomasz D. Loboda José-Luis Pérez-de-la-Cruz

Bayesian networks are graphical modeling tools that have been proven very powerful in a variety of application contexts. The purpose of this paper is to provide education practitioners with the background and examples needed to understand Bayesian networks and use them to design and implement student models. The student model is the key component of any adaptive tutoring system, as it stores al...

Journal: :European Journal of Operational Research 2017
Michael Holzhauser Sven Oliver Krumke Clemens Thielen

We present a specialized network simplex algorithm for the budget-constrained minimum cost flow problem, which is an extension of the traditional minimum cost flow problem by a second kind of costs associated with each edge, whose total value in a feasible flow is constrained by a given budget B. We present a fully combinatorial description of the algorithm that is based on a novel incorporatio...

H. Rastegari, M. Rakhshkhorshid

Many efforts have been made to model the the hot deformation (dynamic recrystallization) flow curves of different materials. Phenomenological constitutive models, physical-based constitutive models and artificial neural network (ANN) models are the main methods used for this purpose. However, there is no report on the modeling of warm deformation (dynamic spheroidization) flow curves of any kin...

Journal: :نشریه دانشکده فنی 0
امیر پیروز قلعه دانشگاه تهران مجید صنایع پسند دانشگاه تهران حامد اسدی دانشگاه تهران

power system blackouts have become a serious problem for electric utilities especially in recent years. different forms of system instability have emerged in recent blackouts, such as voltage instability and frequency instability. to counteract each form of system instability, special algorithms have been designed in the protection system, e.g. under frequency load shedding (ufls) and under vol...

S. Rajalakshmi, T. Beaula,

Abstract In this paper we have investigated a fuzzy linear programming problem with fuzzy quantities which are LR triangular fuzzy numbers. The given linear programming problem is rearranged according to the satisfactory level of constraints using breaking point method. By considering the constraints, the arranged problem has been investigated for all optimal solutions connected with satisf...

A Sheikholeslam K. G. Firouzjah,

This paper presents a fault location technique for transmission lines with minimum current measurement. This algorithm investigates proper current ratios for fault location problem based on thevenin theory in faulty power networks and calculation of short circuit currents in each branch. These current ratios are extracted regarding lowest sensitivity on thevenin impedance variations of the netw...

Flexible and dynamic supply chain network design problem has been studied by many researchers during past years. Since integration of short-term and long-term decisions in strategic planning leads to more reliable plans, in this paper a multi-objective model for a sustainable closed-loop supply chain network design problem is proposed. The planning horizon of this model contains multiple strate...

Mobile ad hoc networks (MANETs) are multi-hop wireless networks of mobile nodes constructed dynamically without the use of any fixed network infrastructure. Due to inherent characteristics of these networks, malicious nodes can easily disrupt the routing process. A traditional approach to detect such malicious network activities is to build a profile of the normal network traffic, and then iden...

Journal: :Math. Program. 1993
James B. Orlin Serge A. Plotkin Éva Tardos

The transshipment problem is one of the central problems in network optimization. There exist several polynomial and strongly polynomial algorithms for solving this problem (see the surveys [7, 1]). Nevertheless, the method of choice in practice still seems to be the network simplex method. In this paper we shall consider the dual network simplex method. We show that some excess scaling algorit...

Bita Alipasandi Neda Alipasandi Shahram Jamali

Random Early Detection (RED) is one of the most commonly used Active Queue Management (AQM) algorithms that is recommended by IETF for deployment in the network. Although RED provides low average queuing delay and high throughput at the same time, but effectiveness of RED is highly sensitive to the RED parameters setting. As network condition varies largely, setting RED's parameters with fixed ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید