An Efficient Algorithm for Information System (CROSBI ID 90635)
Prilog u časopisu | izvorni znanstveni rad
Podaci o odgovornosti
Lovrenčić, Alen
engleski
An Efficient Algorithm for Information System
A general context for the problem of decomposition within an information system is described in [3]. The problem has been classified as a NP-complete problem, which excludes the possibility of an optimal solution of the problem in polynomial time. This paper has two goals: first, to solve the problem within some additional limitations that are usual in the praxis of decomposition and, second, to provide for an on average faster algorithm to calculate the optimal decomposition of an information system into subsystems.
information systems; algorithm; optimization; complexity
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
22 (2)
1998.
137-150-x
objavljeno
0351-1804