548 search results - page 86 / 110 » Parallel Relative Debugging with Dynamic Data Structures |
140
Voted
NN
2002
Springer
15 years 1 months ago
2002
Springer
The ability to grow extra nodes is a potentially useful facility for a self-organising neural network. A network that can add nodes into its map space can approximate the input sp...
113
Voted
MONET
2002
15 years 1 months ago
2002
The Ad hoc Multicast Routing protocol (AMRoute) presents a novel approach for robust IP Multicast in mobile ad hoc networks by exploiting user-multicast trees and dynamic logical c...
130
click to vote
PDP
2008
IEEE
15 years 8 months ago
2008
IEEE
Search engines use inverted files as index data structures to speed up the solution of user queries. The index is distributed on a set of processors forming a cluster of computer...
102
click to vote
MICRO
2007
IEEE
15 years 8 months ago
2007
IEEE
Modern chip multiprocessors (CMPs) are designed to exploit both instruction-level parallelism (ILP) within processors and thread-level parallelism (TLP) within and across processo...
113
click to vote
PODC
1990
ACM
15 years 6 months ago
1990
ACM
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...