Εμφανίζονται 1 - 20 Αποτελέσματα από 185 για την αναζήτηση '', χρόνος αναζήτησης: 0,03δλ Περιορισμός αποτελεσμάτων
  1. 1
    0(logn) Parallel Time Intersection and Union algorithms for a set of planar discs. C.T.I. Technical Reports TR. 87.08.25
    Βιβλίο
  2. 2
    A Competitive Symmetrical Transfer Policy for Load Sharing C.T.I Technical Report TR 98.2.5
    Βιβλίο
  3. 3
    A Frame for the Simulation of Shared Memory on Distributed Memory C.T.I. Technical Report TR. 97.11.39
    Βιβλίο
  4. 4
    A Frame for the Simulation of Shared Memory on Distributed Memory C.T.I. TR. 97.11.40
    Βιβλίο
  5. 5
    A Framework for a Distributed Information Servise Using Hypermedia/ Multimedia Pre-Orchestrated Scenarios C.T.I. Technical Reports TR. 96.5.10
    Βιβλίο
  6. 6
    A General Performance Model for Multistage Interconnection Networks C.T.I. Technical Report TR 97.3.13
    Βιβλίο
  7. 7
    A genetic approach for the parallel almost-uniform generation and approximate counting of matchings C.T.I. Technical Report TR 97.3.19
    Βιβλίο
  8. 8
    A Genetic Approach to Maximum Flow in undirected graphs with Θ(n3/log n) expected time
    Βιβλίο
  9. 9
    A hierarchical model for the evaluation of performance of multiprocessors. [C.T.I. Technical Reports] TR. 90.10.27
    Βιβλίο
  10. 10
    A Multiple Server Model for Multiprocessing [C.T.I. Technical Reports] TR 88.09.55
    Βιβλίο
  11. 11
    A Pan-European Trial for In-Service Training of Educators using Telematics. C.T.I. Technical Reports. TR. 96.10.35
    Βιβλίο
  12. 12
    A parallel algorithm for two processors precedence constraint scheduling C.T.I. Technical Report 91.04.11
    Βιβλίο
  13. 13
    A PMS System Integrating Knowledge-Based Technology and Simulation with On-Line Production Control C.T.I. Technical Report TR 94.09.46
    Βιβλίο
  14. 14
    A randomised algorithm for all pairs shortest paths in 0( ) expected time C.T.I. Technical Report TR 93.07.27
    Βιβλίο
  15. 15
    Algorithmic Game Theory Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010. Proceedings
    ανά Kontogiannis, Spyros
    Έκδοση 2010
    Λήψη πλήρους κειμένου
    Ηλεκτρονική πηγή Εργαλειοθήκη Βιβλίο
  16. 16
    Algorithmic issues in mobile environments with fixed hosts. CTI Technical Report TR 99/11/02
    Έκδοση 1999
    Βιβλίο
  17. 17
    An all pairs shortest algorithm taking 0 (n2 logn/loglogn) time on the average [C.T.I. Technical Report] TR 91.01.2
    Βιβλίο
  18. 18
    An all pairs shortest path algorithm taking 0(n2(loglogn)k) time on the average. [C.T.I. Technical Reports] TR 88.03.47
    Βιβλίο
  19. 19
    An all pairs shortest path algorithm taking O(n2.(loglog n)) time on the anerage. [C.T.I. Technical Reports] TR 88.05.53
    Βιβλίο
  20. 20
    An Architecture for Interactive Distributed Multimedia Information Services. [C.T.I. Technical Reports] TR 96.10.32
    Βιβλίο
Εργαλεία αναζήτησης: Λήψη RSS – Αποστολή αναζήτησης με email