AAAAAA

   
Results: 1-25 | 26-50 | 51-75 | 76-100 | >>

Table of contents of journal: The *Computer journal

Results: 1-25/392
OPTIMAL FAULT-SECURE SCHEDULING
Authors: WU J FERNANDEZ EB DAI DL
Citation: J. Wu et al., OPTIMAL FAULT-SECURE SCHEDULING, Computer journal (Print), 41(4), 1998, pp. 207-222
OPTIMIZING AVERAGE JOB RESPONSE-TIME VIA DECENTRALIZED PROBABILISTIC JOB DISPATCHING IN HETEROGENEOUS MULTIPLE COMPUTER-SYSTEMS
Authors: LI KQ
Citation: Kq. Li, OPTIMIZING AVERAGE JOB RESPONSE-TIME VIA DECENTRALIZED PROBABILISTIC JOB DISPATCHING IN HETEROGENEOUS MULTIPLE COMPUTER-SYSTEMS, Computer journal (Print), 41(4), 1998, pp. 223-230
ON DETECTION OF BOUNDED GLOBAL PREDICATES
Authors: WU IC CHEN LB
Citation: Ic. Wu et Lb. Chen, ON DETECTION OF BOUNDED GLOBAL PREDICATES, Computer journal (Print), 41(4), 1998, pp. 231-237
MORE ON THE EFFICIENCY OF INTERVAL ROUTING
Authors: TSE SSH LAU FCM
Citation: Ssh. Tse et Fcm. Lau, MORE ON THE EFFICIENCY OF INTERVAL ROUTING, Computer journal (Print), 41(4), 1998, pp. 238-242
PERFORMANCE EVALUATION OF FORWARDING STRATEGIES FOR LOCATION MANAGEMENT IN MOBILE NETWORKS
Authors: CHEN IR CHEN TM LEE C
Citation: Ir. Chen et al., PERFORMANCE EVALUATION OF FORWARDING STRATEGIES FOR LOCATION MANAGEMENT IN MOBILE NETWORKS, Computer journal (Print), 41(4), 1998, pp. 243-253
ON DETECTING MULTIPLE FAULTS IN BASE-LINE INTERCONNECTION NETWORKS
Authors: LIN SS CHEN ST
Citation: Ss. Lin et St. Chen, ON DETECTING MULTIPLE FAULTS IN BASE-LINE INTERCONNECTION NETWORKS, Computer journal (Print), 41(4), 1998, pp. 254-269
DETECTING SUBSTITUTIONS AND TRANSPOSITIONS OF CHARACTERS
Authors: ABDELGHAFFAR KAS
Citation: Kas. Abdelghaffar, DETECTING SUBSTITUTIONS AND TRANSPOSITIONS OF CHARACTERS, Computer journal (Print), 41(4), 1998, pp. 270-277
UNTITLED
Authors: TOWNSEND HRA
Citation: Hra. Townsend, UNTITLED, Computer journal (Print), 41(4), 1998, pp. 278-278
ON THE DATA EXPANSION OF THE HUFFMAN COMPRESSION ALGORITHM
Authors: DEPRISCO R DESANTIS A
Citation: R. Deprisco et A. Desantis, ON THE DATA EXPANSION OF THE HUFFMAN COMPRESSION ALGORITHM, Computer journal (Print), 41(3), 1998, pp. 137-144
FORMAL SPECIFICATION OF CONCURRENT SYSTEMS - A STRUCTURED APPROACH
Authors: MAZZEO A MAZZOCCA N RUSSO S SAVY C VITTORINI V
Citation: A. Mazzeo et al., FORMAL SPECIFICATION OF CONCURRENT SYSTEMS - A STRUCTURED APPROACH, Computer journal (Print), 41(3), 1998, pp. 145-162
SEQUENTIAL DIAGNOSIS WITH ASYMMETRICAL TESTS
Authors: BIASIZZO A ZUZEK A NOVAK F
Citation: A. Biasizzo et al., SEQUENTIAL DIAGNOSIS WITH ASYMMETRICAL TESTS, Computer journal (Print), 41(3), 1998, pp. 163-170
FAULT-TOLERANT BROADCASTING ON THE ARRANGEMENT GRAPH
Authors: BAI LQ EBARA H NAKANO H MAEDA H
Citation: Lq. Bai et al., FAULT-TOLERANT BROADCASTING ON THE ARRANGEMENT GRAPH, Computer journal (Print), 41(3), 1998, pp. 171-184
A QUADTREE-BASED DYNAMIC ATTRIBUTE INDEXING METHOD
Authors: TAYEB J ULUSOY O WOLFSON O
Citation: J. Tayeb et al., A QUADTREE-BASED DYNAMIC ATTRIBUTE INDEXING METHOD, Computer journal (Print), 41(3), 1998, pp. 185-200
TOWARDS A MORE PRECISE ANALYSIS OF AN ALGORITHM TO GENERATE BINARY-TREES - A TUTORIAL
Authors: PANHOLZER A PRODINGER H
Citation: A. Panholzer et H. Prodinger, TOWARDS A MORE PRECISE ANALYSIS OF AN ALGORITHM TO GENERATE BINARY-TREES - A TUTORIAL, Computer journal (Print), 41(3), 1998, pp. 201-204
MYTHS OF THE YEAR-2000
Authors: THOMAS M
Citation: M. Thomas, MYTHS OF THE YEAR-2000, Computer journal (Print), 41(2), 1998, pp. 67-70
PROXIMITY SEARCH WITH A TRIANGULATED SPATIAL MODEL
Authors: JONES CB WARE JM
Citation: Cb. Jones et Jm. Ware, PROXIMITY SEARCH WITH A TRIANGULATED SPATIAL MODEL, Computer journal (Print), 41(2), 1998, pp. 71-83
MULTIVIEW MEMORY SUPPORT TO OPERATING-SYSTEMS IN LOCKING FOR TRANSACTION AND DATABASE-SYSTEMS
Authors: BODORIK P JUTLA D
Citation: P. Bodorik et D. Jutla, MULTIVIEW MEMORY SUPPORT TO OPERATING-SYSTEMS IN LOCKING FOR TRANSACTION AND DATABASE-SYSTEMS, Computer journal (Print), 41(2), 1998, pp. 84-97
A STRATEGY FOR USING GENETIC ALGORITHMS TO AUTOMATE BRANCH AND FAULT-BASED TESTING
Authors: JONES BF EYRES DE STHAMER HH
Citation: Bf. Jones et al., A STRATEGY FOR USING GENETIC ALGORITHMS TO AUTOMATE BRANCH AND FAULT-BASED TESTING, Computer journal (Print), 41(2), 1998, pp. 98-107
HPP - A RELIABLE CAUSAL BROADCAST PROTOCOL FOR LARGE-SCALE REPLICATION IN WIDE AREA NETWORKS
Authors: KUMAR A ADLY N
Citation: A. Kumar et N. Adly, HPP - A RELIABLE CAUSAL BROADCAST PROTOCOL FOR LARGE-SCALE REPLICATION IN WIDE AREA NETWORKS, Computer journal (Print), 41(2), 1998, pp. 108-124
ESTABLISHING SECURE ETHERNET LANS USING INTELLIGENT SWITCHING HUBS ININTERNET ENVIRONMENTS
Authors: TSAUR WJ HORNG SJ
Citation: Wj. Tsaur et Sj. Horng, ESTABLISHING SECURE ETHERNET LANS USING INTELLIGENT SWITCHING HUBS ININTERNET ENVIRONMENTS, Computer journal (Print), 41(2), 1998, pp. 125-133
A WEAKEST PRECONDITION SEMANTICS FOR Z
Authors: CAVALCANTI A WOODCOCK J
Citation: A. Cavalcanti et J. Woodcock, A WEAKEST PRECONDITION SEMANTICS FOR Z, Computer journal (Print), 41(1), 1998, pp. 1-15
THE COMPLEXITY OF INTERVAL ROUTING ON RANDOM GRAPHS
Authors: FLAMMINI M VANLEEUWEN J MARCHETTISPACCAMELA A
Citation: M. Flammini et al., THE COMPLEXITY OF INTERVAL ROUTING ON RANDOM GRAPHS, Computer journal (Print), 41(1), 1998, pp. 16-25
THE PERFORMANCE IMPACT OF EXPLOITING BRANCH ILP WITH TREE-REPRESENTATION OF ILP CODE
Authors: MOON SM EBCIOGLU K
Citation: Sm. Moon et K. Ebcioglu, THE PERFORMANCE IMPACT OF EXPLOITING BRANCH ILP WITH TREE-REPRESENTATION OF ILP CODE, Computer journal (Print), 41(1), 1998, pp. 26-44
LOGIC DESIGN OF A FAST CIRCUIT FOR ITERATIVE ADDITIONS IN REDUNDANT HYBRID NUMBER-SYSTEMS
Authors: ALIA G MARTINELLI E
Citation: G. Alia et E. Martinelli, LOGIC DESIGN OF A FAST CIRCUIT FOR ITERATIVE ADDITIONS IN REDUNDANT HYBRID NUMBER-SYSTEMS, Computer journal (Print), 41(1), 1998, pp. 45-51
TIGHT BOUNDS ON THE DIAMETER OF GAUSSIAN CUBES
Authors: KWAI DM PARHAMI B
Citation: Dm. Kwai et B. Parhami, TIGHT BOUNDS ON THE DIAMETER OF GAUSSIAN CUBES, Computer journal (Print), 41(1), 1998, pp. 52-56
Risultati: 1-25 | 26-50 | 51-75 | 76-100 | >>