z-logo
open-access-imgOpen Access
Difficult Data Placement Problems
Author(s) -
David A. Bell
Publication year - 1984
Publication title -
the computer journal
Language(s) - French
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/27.4.315
Subject(s) - computer science , heuristic , completeness (order theory) , algorithm , theoretical computer science , mathematical optimization , mathematics , artificial intelligence , mathematical analysis
Les problemes de placement de donnees sont etudies de maniere abstraite et on utilise la theorie de la NP-completude pour prouver quelques resultats qui indiquent le niveau de difficulte de quelques problemes de placement de donnees de plus en plus realistes

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom