541 search results - page 77 / 109 » An Efficient Algorithm for the Longest Pattern Subsequence P... |
204
click to vote
CP
2009
Springer
16 years 2 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
125
click to vote
CN
1998
15 years 1 months ago
1998
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
120
click to vote
ALGORITHMICA
2006
15 years 2 months ago
2006
Our goal is to develop a robust out-of-core sorting program for a distributed-memory cluster. The literature contains two dominant paradigms for out-of-core sorting algorithms: me...
119
click to vote
DAGSTUHL
1990
15 years 3 months ago
1990
One of the principal advantages of parallelizing a rule-based system, or more generally, any A.I. system, is the ability to pursue alternate search paths concurrently. Conventiona...
102
click to vote
KDD
2004
ACM
16 years 2 months ago
2004
ACM
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...