Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Journal: Elektronische Informationsverarbeitung und Kybernetik
Found
28 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Reading data in a hierarchical memory
1991,
Leopold C.
In 1987 A Aggarwal, A.K. Chandra and M. Snir developed a model of hierarchical memory...
On relational database schemes having unique minimal key
1991,
Biskup J.
The relational database schemes having unique minimal key are completely...
On Time Petri nets
1991,
Popova L.
This paper shows how to study boundedness and liveness of a finite Time Petri net in a...
Reliability bounds based on network splitting
1991,
Tittmann P.
The K -terminal reliability is the probability that all K -vertices in a stochastic...
A special problem on rectangular floorplans solvable in polynomial time
1991,
Br G.
S.L. Hakimi has studied the problem of packing rectangles with given areas and...
A three-dimensional bin packing algorithm
1991,
Scheithauer G.
In this paper an approximation algorithm for the three-dimensional bin packing problem...
Minimal area sizing of power supply nets in VLSI circuits
1990,
Kolla R. .
The paper presents a simple dynamic programming approach to find minimum area sizings...
An finite capacity telecommunication system with repeated calls
1989,
Pourbabai Behnam
The performance of a finite capacity random access telecommunication system with...
Reliability analysis of a complex renewable system with fast repair
1989,
Anisimov Vladimir V.
The present paper is concerned with an asymptotic analysis of a complex renewable...
Graphs-theoretical properties and chain code picture languages
1989,
Dassow Jrgen
The paper describes pictures by words over the alphabet {up, down, right, left} whose...
Graphs and automata in the theory of signature analysis
1990,
Voelkel Lutz
Signature analysis is a compact method in digital testing. Applying this method, a...
Solving generalized equations over infinite trees
1989,
Habasinski Zdzislaw
In the paper a nondeterministic algorithm for solving sets of equations between terms...
Lower bounds proofs via Voronoi diagrams
1989,
Fischer Thomas
It is shown that the large class of geometric problems satisfying an ¦[( n log...
A time logic for hierarchical modelling of dynamic systems
1989,
Schfer-Richter Gisela
The paper surveys hierarchical modelling, with emphasis on temporal hierarchical...
Algebraic specification of modules and configuration families
1989,
Ehrig Hartmut
Modular software systems usually evolve during a longer period of time, in which...
A Generalized Multi-commodity Location-Allocation Model
1989,
Markis Andreas
The aim of this paper is to present a Generalized Multi-commodity Location-Allocation...
On optimal pair sequences
1989,
Grnwald Norbert
Given two disjoint groups X and Y , each containing n people. Suppose an experiment...
Hamiltonian properties of the Cartesian sum of hypergraphs
1989,
Sonntag Martin
The paper presents sufficient conditions guaranteeing traceability and Hamiltonicity...
Asymptotic reliability of some complex systems with repair operating in random environments
1989,
Sztrik Jnos
The paper is concerned with an asymptotic reliability analysis of some complex systems...
A random access telecommunication system
1988,
Pourbabai Behnam
The performance of a random access telecommunication system with repeated calls in...
About closed sets of linear functions in many-valued logics
1988,
Lau Dietlinde
In this paper all closed sets of the set L k of linear functions of k -valued logic...
Graph controlled table Lindenmayer systems
1988,
Hromkovic N.
A new type of Lindenmayer systems-graph controlled table Lindenmayer system-is...
On keys in the relational data model
1988,
Demetrovics Jnos
The main purpose of this paper is to prove that for a given relation there exists a...
Individual call blocking probabilities in the loss systems SM+M/M/N and G+M/M/N
1988,
Willie Helmut
A method is derived for calculating the individual call blocking probabilities which...
1
2
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers