5802 search results - page 904 / 1161 » Parallelizing Feature Selection |
167
click to vote
HPDC
1999
IEEE
15 years 11 months ago
1999
IEEE
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
143
click to vote
HPCA
1998
IEEE
15 years 11 months ago
1998
IEEE
Scalable shared-memory multiprocessors that are designed as Cache-Only Memory Architectures Coma allow automatic replication and migration of data in the main memory. This enhance...
195
click to vote
ICPP
1998
IEEE
15 years 11 months ago
1998
IEEE
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
153
click to vote
PODC
1989
ACM
15 years 10 months ago
1989
ACM
: What should it mean for an agent to know or believe an assertion is true with probability :99? Di erent papers FH88, FZ88, HMT88] give di erent answers, choosing to use quite di ...
218
click to vote
ICS
1995
Tsinghua U.
15 years 10 months ago
1995
Tsinghua U.
Current data cache organizations fail to deliver high performance in scalar processors for many vector applications. There are two main reasons for this loss of performance: the u...