Entity usage

Showing below up to 50 results in range #51 to #100.

51. Data redistribution and remote method invocation for coupled components: Label: en
52. FIR: an efficient routing strategy for tori and meshes: Label: en
53. Fractal: a mobile code-based framework for dynamic application protocol adaptation: Label: en
54. LAD: localization anomaly detection for wireless sensor networks: Label: en
55. Broadcasting in all-output-port cube-connected cycles with distance-insensitive switching: Label: en
56. Average-case performance analysis of scheduling random parallel tasks with precedence constraints on mesh connected multicomputer systems: Label: en
57. Speculative pre-execution assisted by compiler (SPEAR): Label: en
58. Parallel CBIR implementations with load balancing algorithms: Label: en
59. Grid computing for parallel bioinspired algorithms: Label: en
60. Adaptive algorithms for the dynamic distribution and parallel execution of agent-based models: Label: en
61. The speciating Island model: an alternative parallel evolutionary algorithm: Label: en
62. Stigmergic approaches applied to flexible fault-tolerant digital VLSI architectures: Label: en
63. Initial approaches to the application of islands-based parallel EDAs in continuous domains: Label: en
64. Assign ranges in general ad-hoc networks: Label: en
65. Further remark on P systems with active membranes and two polarizations: Label: en
66. Designing irregular parallel algorithms with mutual exclusion and lock-free protocols: Label: en
67. Effect of network latency on load sharing in distributed systems: Label: en
68. Dyn-MPI: supporting MPI on medium-scale, non-dedicated clusters: Label: en
69. Provable algorithms for parallel generalized sweep scheduling: Label: en
70. Utilizing unreliable public resources for higher profit and better sla compliance in computing utilities: Label: en
71. Fast batched data transfer with flush channels: a performance analysis: Label: en
72. Algebraic analysis of the topological properties of a banyan network and its application in fault-tolerant switching networks: Label: en
73. A light-weight, collaborative temporary file system for clustered web servers: Label: en
74. Finding a suitable checkpoint and recovery protocol for a distributed application: Label: en
75. DistDLB: improving cosmology SAMR simulations on distributed computing systems through hierarchical load balancing: Label: en
76. The fat-stack and universal routing in interconnection networks: Label: en
77. A new family of interconnection networks of odd fixed degrees: Label: en
78. Employing nested OpenMP for the parallelization of multi-zone computational fluid dynamics applications: Label: en
79. Performance characteristics of the multi-zone NAS parallel benchmarks: Label: en
80. Efficient synthesis of out-of-core algorithms using a nonlinear optimization solver: Label: en
81. Running OpenMP applications efficiently on an everything-shared SDSM: Label: en
82. Translating submachine locality into locality of reference: Label: en
83. Randomized smoothing networks: Label: en
84. An average-case analysis of online non-clairvoyant scheduling of independent parallel tasks: Label: en
85. Static allocation of resources to communicating subtasks in a heterogeneous ad hoc grid environment: Label: en
86. Fault-tolerant wireless sensor network routing protocols for the supervision of context-aware physical environments: Label: en
87. Fast distributed algorithm for convergecast in ad hoc geometric radio networks: Label: en
88. Maximum lifetime data sensing and extraction in energy constrained networked sensor systems: Label: en
89. Efficient management of transient station failures in linear radio communication networks with bases: Label: en
90. A rule-based adaptive routing protocol for continuous data dissemination in WSNs: Label: en
91. Wireless ad hoc lattice computers (WAdL): Label: en
92. Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks: Label: en
93. A fast localized algorithm for scheduling sensors: Label: en
94. Greedy localized routing for maximizing probability of delivery in wireless ad hoc networks with a realistic physical layer: Label: en
95. Parallel multigrid summation for the \(N\)-body problem: Label: en
96. Performance analysis of dynamic load balancing algorithms with variable number of processors: Label: en
97. Packet routing and selection on the POPS network: Label: en
98. Parallel recognition algorithms for chordal-planar graphs and planar \(k\)-trees: Label: en
99. Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication: Label: en
100. Finding strongly connected components in distributed graphs: Label: en