1866 search results - page 198 / 374 » Robust Algorithms and Price of Robustness in Shunting Proble... |
134
click to vote
SWAT
1992
Springer
15 years 10 months ago
1992
Springer
The k-compaction problem arises when k out of n cells in an array are non-empty and the contents of these cells must be moved to the first k locations in the array. Parallel algori...
226
click to vote
TKDE
2012
13 years 9 months ago
2012
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
199
click to vote
IJCAI
1989
15 years 7 months ago
1989
Several published reports show that instancebased learning algorithms yield high classification accuracies and have low storage requirements during supervised learning application...
172
click to vote
ALGORITHMICA
2006
15 years 6 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...
153
click to vote
AUSAI
2003
Springer
15 years 11 months ago
2003
Springer
An important task in machine learning is determining which learning algorithm works best for a given data set. When the amount of data is small the same data needs to be used repea...