All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 69 Next

Displaying 1361 – 1380 of 1566

Showing per page

Task criticalness potential: A multiple criteria approach to project management

Helena Brožová, Jan Bartoška, Tomáš Šubrt, Jan Rydval (2016)

Kybernetika

The paper proposes the method evaluating tasks criticalness potential, which has been analysed by various project management tools. The criticalness potential of tasks, as opposed to a simple differentiation of tasks to critical and non-critical using the CPM method, considers not only time, but also resource, cost and topological aspects of a project schedule. In the paper, the tasks criticalness potential is defined applying task criticalness indicators which are further used as input for three...

Test signal design for failure detection: A linear programming approach

Héctor Scola, Ramine Nikoukhah, François Delebecque (2003)

International Journal of Applied Mathematics and Computer Science

A new methodology for the design of filters that permits failure detection and isolation of dynamic systems is presented. Assuming that the normal and the faulty behavior of a process can be modeled by two linear systems subject to inequality bounded perturbations, a method for the on-line implementation of a test signal, guaranteeing failure detection, is proposed. To improve the fault detectability of the dynamic process, appropriate test signals are injected into the system. All the computations...

Test signal generation for service diagnosis based on local structural properties

Michael Ungermann, Jan Lunze, Dieter Schwarzmann (2012)

International Journal of Applied Mathematics and Computer Science

The paper presents a new approach to the generation of test signals used in service diagnosis. The tests make it possible to isolate faults, which are isolable only if the system is brought into specific operating points. The basis for the test signal selection is a structure graph that represents the couplings among the external and internal signals of the system and the fault signals. Graph-theoretic methods are used to identify edges that disappear under certain operating conditions and prevent...

The branch and bound algorithm for a backup virtual path assignment in survivable ATM networks

Krzysztof Walkowiak (2002)

International Journal of Applied Mathematics and Computer Science

Issues of network survivability are important, since users of computer networks should be provided with some guarantees of data delivery. A large amount of data may be lost in high-speed Asynchronous Transfer Mode (ATM) due to a network failure and cause significant economic loses. This paper addresses problems of network survivability. The characteristics of virtual paths and their influence on network restoration are examined. A new problem of Backup Virtual Path Routing is presented for the local-destination...

The Capacitated Arc Routing Problem. A heuristic algorithm.

Enrique. Benavent, V. Campos, Angel Corberán, Enrique Mota (1990)

Qüestiió

In this paper we consider the Capacitated Arc Routing Problem, in which a fleet of K vehicles, all of them based on a specific vertex (the depot) and with a known capacity Q, must service a subset of the edges of the graph, with minimum total cost and such that the load assigned to each vehicle does not exceed its capacity.A heuristic algorithm for this problem is proposed consisting of: the selection of K centers, the construction of K connected graphs with associated loads not exceeding the vehicle...

Currently displaying 1361 – 1380 of 1566