Εμφανίζονται 41 - 60 Αποτελέσματα από 432 για την αναζήτηση '', χρόνος αναζήτησης: 0,04δλ Περιορισμός αποτελεσμάτων
  1. 41
    A Proof of Menger's Theorem C.T.I. Technical Report TR 92.01.1
    Βιβλίο
  2. 42
    A provably efficient computational model for approximate spatiotemporal retrieval. C.T.I. TR 99/05/02
    Βιβλίο
  3. 43
    A purely asynchronous, message-efficient distributed algorithm for achieving arc consistency in networks of relations [Technical Report] CTI TR 95.5.21
    Βιβλίο
  4. 44
    A randomised algorithm for all pairs shortest paths in 0( ) expected time C.T.I. Technical Report TR 93.07.27
    Βιβλίο
  5. 45
    A real-time auction system over the WWW CTI Technical Report 99.03.01
    Έκδοση 1999
    Βιβλίο
  6. 46
    A Relational Database Support for Rapid Prototyping: the SEPDS Approach [C.T.I. Technical Reports] TR. 90.08.21
    Βιβλίο
  7. 47
    A Rule for Fast Computation and of Soliton Automata C.T.I. Technical Reports TR. 87.05.01
    Βιβλίο
  8. 48
    A Simplified Algorithm for Input-Output Decoupling of a Non Linear System Via Dynamic Compensator. C.T.I. Technical Reports TR. 87.10.34
    Βιβλίο
  9. 49
    A Space-optimal algorithm for the Object Complexity of the Hidden Surface Elimination Problem for Rectangles CTI Technical Reports. TR.96.12.41
    Βιβλίο
  10. 50
    A Study on a Special Purpose Parallel Architecture for Large Scale Simulations. [C.T.I. Technical Reports] TR. 89.02.77
    Βιβλίο
  11. 51
    A Survey of Concurrent Readers and Writers [C.T.I. Technical Reports] TR. 89.10.97
    Βιβλίο
  12. 52
    A Web based Educational Application for Environmental Science Courses C.T.I. Technical Report TR 98.2.7
    Βιβλίο
  13. 53
    Ada-Based Design Language Guidelines Final Technical Report (CDRL 0001AB) January 14, 1986
    Έκδοση 1987
    Βιβλίο
  14. 54
    Algorithmic issues in mobile environments with fixed hosts. CTI Technical Report TR 99/11/02
    Έκδοση 1999
    Βιβλίο
  15. 55
    An Ada Based Distributed File System [C.T.I. Technical Reports] TR 88.11.67
    Βιβλίο
  16. 56
    An algorithm to revise beliefs of a nonmonotonic multiple inheritance reasoner based on WINs C.T.I. Technical Report TR 93.09.34
    Βιβλίο
  17. 57
    An all pairs shortest algorithm taking 0 (n2 logn/loglogn) time on the average [C.T.I. Technical Report] TR 91.01.2
    Βιβλίο
  18. 58
    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. 59
    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. 60
    An Analysis of the Literary Style of poet A.Sikelianos-A Computer Based Approach C.T.I. Technical Report TR 94.08.44
    Βιβλίο
Εργαλεία αναζήτησης: Λήψη RSS – Αποστολή αναζήτησης με email