On a World Wide Web-Based Planning Support System
On bandwidth, cutwidth, and quotient graphs
On -wise arc forwarding index and wavelength allocations in faulty all-optical hypercubes
Motivated by the wavelength division multiplexing in all-optical networks, we consider the problem of finding an optimal (with respect to the least possible number of wavelengths) set of internally node disjoint dipaths connecting all pairs of distinct nodes in the binary -dimensional hypercube, where . This system of dipaths constitutes a routing protocol that remains functional in the presence of up to faults (of nodes and/or links). The problem of constructing such protocols for general...
On fuzzy temporal constraint networks.
Temporal Constraint Networks are a well-defined, natural and efficient formalism for representing temporal knowledge based on metric temporal constraints. They support the representation of both metric and some qualitative temporal relations and are provided with efficient algorithms based on CSP techniques. Recently, a generalization based on fuzzy sets has been proposed in order to cope with vagueness in temporal relations. In this paper we generalize some earlier definitions for Fuzzy Temporal...
On infinite-server queues with cyclically dependent service times
On minimizing total tardiness in a serial batching problem
We study the problem of scheduling jobs on a serial batching machine to minimize total tardiness. Jobs of the same batch start and are completed simultaneously and the length of a batch equals the sum of the processing times of its jobs. When a new batch starts, a constant setup time occurs. This problem s-batch is known to be NP-Hard in the ordinary sense. In this paper we show that it is solvable in pseudopolynomial time by dynamic programming.
On Minimizing Total Tardiness in a Serial Batching Problem
We study the problem of scheduling jobs on a serial batching machine to minimize total tardiness. Jobs of the same batch start and are completed simultaneously and the length of a batch equals the sum of the processing times of its jobs. When a new batch starts, a constant setup time s occurs. This problem 1|s-batch | ∑Ti is known to be NP-Hard in the ordinary sense. In this paper we show that it is solvable in pseudopolynomial time by dynamic programming.
On network flow equations and splitting formulas for sojourn times in queueing networks.
On scheduling models.
On schemata and systems for parallel algorithms
On the behaviour of learning algorithms in a changing environment with application to data network routing problem
On the ergodic distribution of oscillating queueing systems.
On the homology of small categories and asynchronous transition systems.
On the level crossing of multi-dimensional delayed renewal processes.
On the M/G/1 retrial queue subjected to breakdowns
Retrial queueing systems are characterized by the requirement that customers finding the service area busy must join the retrial group and reapply for service at random intervals. This paper deals with the M/G/1 retrial queue subjected to breakdowns. We use its stochastic decomposition property to approximate the model performance in the case of general retrial times.
On the M/G/1 retrial queue subjected to breakdowns
Retrial queueing systems are characterized by the requirement that customers finding the service area busy must join the retrial group and reapply for service at random intervals. This paper deals with the M/G/1 retrial queue subjected to breakdowns. We use its stochastic decomposition property to approximate the model performance in the case of general retrial times.
On the proper intervalization of colored caterpillar trees
This paper studies the computational complexity of the proper interval colored graph problem (PICG), when the input graph is a colored caterpillar, parameterized by hair length. In order prove our result we establish a close relationship between the PICG and a graph layout problem the proper colored layout problem (PCLP). We show a dichotomy: the PICG and the PCLP are NP-complete for colored caterpillars of hair length ≥2, while both problems are in P for colored caterpillars of hair length <2. For...
On the quantum chromatic number of a graph.
On ƒ-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes
Motivated by the wavelength division multiplexing in all-optical networks, we consider the problem of finding an optimal (with respect to the least possible number of wavelengths) set of ƒ+1 internally node disjoint dipaths connecting all pairs of distinct nodes in the binary r-dimensional hypercube, where 0 ≤ ƒ < r. This system of dipaths constitutes a routing protocol that remains functional in the presence of up to ƒ faults (of nodes and/or links). The problem of constructing such...
Optimal double-loop networks with non-unit steps.