Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             58 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 Accelerating machines: a review Fraser, Robert
2008
1 p. 81-104
artikel
2 A DIVIDE-AND-INNER PRODUCT PARALLEL ALGORITHM FOR POLYNOMIAL EVALUATION Hu, Jie
1995
1 p. 63-66
artikel
3 A hybrid searching scheme in unstructured P2P networks Li, Xiuqi
2007
1 p. 15-38
artikel
4 A MODAL LOGIC FORMALISM FOR DISTRIBUTED AND PARALLEL KNOWLEDGE BASES Levene, Mark
1993
1 p. 11-27
artikel
5 A new modelling approach of wormhole-switched networks with finite buffers Alzeidi, N.
2008
1 p. 45-57
artikel
6 A NEW MODIFIED GRAM-SCHMIDT ORTHOGONAL MATRIX FACTORIZATION BASED ALGORITHM FOR PARALLEL SOLUTION OF LINEAR EQUATIONS Murthy, K. N. Balasubramanya
1995
1 p. 39-52
artikel
7 An integrated mobile agent framework for distributed network management† Kona, Manoj Kumar
2005
1 p. 39-55
artikel
8 AN INTRODUCTION TO THE SPECIAL ISSUE Langston, Michael A.
1996
1 p. 1-2
artikel
9 A PARALLEL ALGORITHM FOR FIXED-DIMENSIONAL LINEAR PROGRAMMING Kuzyurin, Nikolai N.
1995
1 p. 17-24
artikel
10 A PARALLEL DEMAND-DRIVEN SIMULATION ALGORITHM FOR SIMD COMPUTERS Fouliras, P. E.
1998
1 p. 53-73
artikel
11 A Parallel four points modified explicit group algorithm on shared memory multiprocessors Othman, M.
2004
1 p. 1-9
artikel
12 A PARALLEL METHOD FOR QUASILINEAR PROBLEMS Gasparo, M. G.
1995
1 p. 79-86
artikel
13 A PARTITIONING ALGORITHM FOR COMPOSITE GRIDS Thune, Michael
1993
1 p. 69-81
artikel
14 APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES Luce, Guillaume
1998
1 p. 27-52
artikel
15 A quadrilateral-object composer for binary images with reaction-diffusion cellular automata Asai, Tetsuya
2005
1 p. 57-67
artikel
16 A RIGOROUS ANALYSIS OF TIME DOMAIN PARALLELISM Deshpande, A.
1995
1 p. 53-62
artikel
17 A SIMPLE SELECTION ALGORITHM FOR RECONFIGURABLE MESHES Olariu, S.
1993
1 p. 29-41
artikel
18 BLOCK-JACOBI SVD ALGORITHMS FOR DISTRIBUTED MEMORY SYSTEMS II: MESHES* Becka, Martin
1999
1 p. 37-56
artikel
19 COMBINING HELPFUL SETS AND PARALLEL SIMULATED ANNEALING FOR THE GRAPH-PARTITIONING PROBLEM Diekmann, Ralf
1996
1 p. 61-84
artikel
20 Cooperative ad hoc computing: towards enabling cooperative processing in wireless environments Alsalih, Waleed
2008
1 p. 59-79
artikel
21 DECOMPOSITION AND MAPPING OF LOCALLY CONNECTED LAYERED NEURAL NETWORKS ON MESSAGE-PASSING MULTIPROCESSORS Tollenaere, Tom
1993
1 p. 43-56
artikel
22 DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM Lin, Yen-Chun
2002
1 p. 1-18
artikel
23 Design and performance issues of slave-slave cluster interconnection in 802.15.4 beacon enabled networks Misic, Jelena
2007
1 p. 59-75
artikel
24 EDITORIAL Evans, D. J.
1993
1 p. 1
artikel
25 Editorial 2005
1 p. 1-3
artikel
26 EFFECTIVE PARALLELIZATION TECHNIQUES FOR LOOP NESTS WITH NON-UNIFORM DEPENDENCES Pean, Der-Lin
2001
1 p. 37-64
artikel
27 EFFICIENT ALGORITHMS ON THE HYPERSTAR NETWORK Al-Ayyoub, Abdel-Elah
1999
1 p. 79-88
artikel
28 Efficient binary and grey level morphological operations on a massively parallel processor Svolos, Andreas I.
2004
1 p. 33-50
artikel
29 EVENTUAL DETERMINISM: USING PROBABILISTIC MEANS TO ACHIEVE DETERMINISTIC ENDS Rao, Josyula R.
1996
1 p. 3-19
artikel
30 EXTREMAL CODES FOR SPEED-UP OF DISTRIBUTED PARALLEL ARBITRATION Makhaniok, M.
1995
1 p. 1-16
artikel
31 FAST NEAREST NEIGHBOR ALGORITHMS ON A LINEAR ARRAY WITH A RECONFIGURABLE PIPELINED BUS SYSTEM Pan, Yi
1998
1 p. 1-25
artikel
32 Fast reconfiguration algorithms for time, space, and wavelength dilated optical Benes networks Lu, Enyue
2007
1 p. 39-58
artikel
33 HARDWARE/SOFTWARE MODELING OF FPGA-BASED SYSTEMS Sklyarov, V.
2002
1 p. 19-39
artikel
34 ISRL: intelligent search by reinforcement learning in unstructured peer-to-peer networks Li, Xiuqi
2008
1 p. 17-44
artikel
35 Journeys in non-classical computation I: A grand challenge for computing research Stepney, Susan
2005
1 p. 5-19
artikel
36 LEFTMOST EIGENVALUE OF REAL AND COMPLEX SPARSE MATRICES ON PARALLEL COMPUTER USING APPROXIMATE INVERSE PRECONDITIONING Pini, Giorgio
2002
1 p. 41-58
artikel
37 MODELS AND RESOURCE METRICS FOR PARALLEL AND DISTRIBUTED COMPUTATION Li, Zhiyong
1996
1 p. 35-59
artikel
38 Multi-shared-trees based multicast routing control protocol using anycast selection Jia, Weijia
2005
1 p. 69-84
artikel
39 o(log4 n) time parallel maximal matching algorithm using linear number of processors Datta, Alak Kumar
2004
1 p. 19-32
artikel
40 On the double-vertex-cycle-connectivity of crossed cubes Yang, Xiaofan
2004
1 p. 11-17
artikel
41 ON THE PARALLEL IMPLEMENTATION OF A GENERALIZED BROADCAST Wedler, Christoph
2001
1 p. 65-82
artikel
42 On the session lifetime distribution of Gnutella Ho, Kevin
2008
1 p. 1-15
artikel
43 On the use of metatypes for safe embedded operating system extension Grimaud, Gilles
2007
1 p. 1-13
artikel
44 PARALLEL ALGORITHMS TO COMPUTE THE EIGENVALUES AND EIGENVECTORS OFSYMMETRIC TOEPLITZ MATRICES Badia, J. M.
1998
1 p. 75-93
artikel
45 PARALLEL CHAOTIC ALGORITHMS FOR SINGULAR LINEAR SYSTEMS Bahi, J.
1999
1 p. 19-35
artikel
46 PARALLEL SYMMETRIC ELIMINATION FOR POSITIVE DEFINITE LINEAR SYSTEMS Chawla, M. M.
1995
1 p. 67-78
artikel
47 PARALLEL SYNERGY Akl, Selim G.
1993
1 p. 3-9
artikel
48 Performance modelling of broadcast communication in multicomputer networks Shahrabi, A.
2005
1 p. 21-37
artikel
49 RECYCLING RANDOM BITS IN PARALLEL Friedl, Katalin
1996
1 p. 85-94
artikel
50 RESTARTING TECHNIQUES FOR THE LANCZOS ALGORITHM AND THEIR IMPLEMENTATION IN PARALLEL COMPUTING ENVIRONMENTS: ARCHITECTURAL INFLUENCES Szularz, M.
1999
1 p. 57-77
artikel
51 SCHEDULING INTERVAL ORDERS IN PARALLEL Mayr, Ernst W.
1996
1 p. 21-34
artikel
52 SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS Antonoiu, Gheorghe
2001
1 p. 17-35
artikel
53 SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS Datta, Ajoy K.
2001
1 p. 1-15
artikel
54 SELF-STABILIZING PROTOCOL FOR MUTUAL EXCLUSION AMONG NEIGHBORING NODES IN A TREE STRUCTURED DISTRIBUTED SYSTEM Antonoiu, Gheorghe
1999
1 p. 1-18
artikel
55 STATIC PERFORMANCE PREDICTION OF SKELETAL PARALLEL PROGRAMS Hayashi, Yasushi
2002
1 p. 59-84
artikel
56 THE ARITHMETIC MEAN METHOD FOR FINDING THE STATIONARY VECTOR OF MARKOV CHAINS Benzi, Michele
1995
1 p. 25-37
artikel
57 THE FASTEST MATRIX VECTOR MULTIPLICATION Gusev, Marjan
1993
1 p. 57-67
artikel
58 Tools for Regularizing Array Designs Manjunathaiah, M.
2004
1 p. 51-75
artikel
                             58 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland