Miura, T. and Ishida, T. 1998. Stochastic node caching for memory-bounded search. In Proc. of the 16th National Con- ference on Artificial Intelligence (AAAI-98), 450-456.T. Miura, T. Ishida, Stochastic node ca
This behavior is different from on-chip memories, latency to which tends to be bounded. • The theoretical throughput number to the DDR memories is not achieved in practice. Both aspects can be made visible by benchmarking the DDR performance as described elsewhere. We show an example below ...
a single swap space. The memory management subsystem uses a special algorithm to interleave swap I/O among multiple disks. This algorithm performs better than striping at a hardware or LSM level, so it's best to take advantage of it. Finally, from a hardware point of view, use only fast...
acquisition functions as well as against three more algorithms: (1) HEBO, the winning submission of the NeurIPS 2020 Black-Box optimization challenge50 and one algorithm from each of the two classes of partial NiaH solutions (2) TuRBO (bounded search space)39 and (3) MiP-EGO (faster compute...
Briefly, we have developed a cell subsampling algorithm built upon Scarf that can allow generating highly representative subsets of data for usage in other tools. We have introduced a visualisation and clustering algorithm, that were previously unknown in the single-cell field, for a faster and ...
Pairwise learning is a specialized form of supervised learning that focuses on predicting outcomes for pairs of objects. In this paper, we formulate the pa
HiCOPS to avoid a 50% performance loss in database indexing step for our GPUs (see Performance Evaluation section). Finally, we compared the peptide identification results between GiCOPS and MSFragger7(a database search engine that employs a similar, but proprietary, fragment-ion based algorithm)...
Efficient concurrent bounded FIFO data structures with various performance trade-off. This includes specialization for single-reader, many-reader, single-writer and many-writer. ck_fifo A reference implementation of the first published lock-free FIFO algorithm, with specialization for single-enqueuer-sin...
C++ generic algorithm is not perfect either. There is no guarantee in the standard that std::sort won't allocate any memory. If you are running on embedded, in real-time or on 100+ CPU cores per node, you may want to avoid that. StringZilla doesn't solve the general case, but ...
In this paper, we propose an external memory depth first search algorithm for general grid graphs. The I/O-complexity of the algorithm is O(sort(N)log2NM), where N=|V|+|E|, sort(N)=Θ(NBlogM/BNB) is the sorting I/O-complexity, M is the memory size, and B is the block size...