Results 271 to 280 of about 459,449 (308)
Some of the next articles are maybe not open access.
2021
New non-volatile memory (NVM) technologies are projected to become the dominant type of main memory in the near future. They promise by the addressability, good read latencies, and significantly lower energy and higherdensity compared to DRAM. However, a key property of NVMs is the asymmetric read and write cost: write operations are much more ...
openaire +1 more source
New non-volatile memory (NVM) technologies are projected to become the dominant type of main memory in the near future. They promise by the addressability, good read latencies, and significantly lower energy and higherdensity compared to DRAM. However, a key property of NVMs is the asymmetric read and write cost: write operations are much more ...
openaire +1 more source
Engineering Efficient Paging Algorithms
ACM Journal of Experimental Algorithmics, 2012In the field of online algorithms, paging is a well-studied problem. LRU is a simple paging algorithm that incurs few cache misses and supports efficient implementations. Algorithms outperforming LRU in terms of cache misses exist but are in general more complex and thus not automatically better, since their increased runtime might ...
Gabriel Moruz +3 more
openaire +1 more source
Efficient algorithms for decode efficient prefix codes
2021 Data Compression Conference (DCC), 2021The cost of decompressing (decoding) data can be prohibitive for certain real-time applications. In many scenarios, it is acceptable to sacrifice (to some extent) on compression in the interest of fast decoding. We study anovel problem of finding a prefix tree having the best decode time under the constraint that the code length does not exceed a ...
Shashwat Banchhor +3 more
openaire +1 more source
Efficient Algorithms for Similarity Search
Journal of Combinatorial Optimization, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sanguthevar Rajasekaran +6 more
openaire +1 more source
On Efficient Algorithms for SAT
2013There are several papers in which SAT is solved in linear time by various new computing paradigms, and specially by various membrane computing systems. In these approaches the used alphabet depends on the number of variables. That gives different classes of the problem by the number of the variables.
openaire +1 more source
Improving the Efficiency of the PPM Algorithm
Problems of Information Transmission, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
An Efficient Equipment-Layout Algorithm
Operations Research, 1974This paper treats the problem of locating a given number of interrelated physical facilities in a single- or multi-story building as an optimization model such that the weighted sum of the distances along orthogonal directions is minimized, and describes a constructive heuristic algorithm for the one-dimensional model.
openaire +2 more sources
Efficient Algorithm for the Partitioning of Trees
IBM Journal of Research and Development, 1974This paper describes an algorithm for partitioning a graph that is in the form of a tree. The algorithm has a growth in computation time and storage requirements that is directly proportional to the number of nodes in the tree. Several applications of the algorithm are briefly described.
openaire +2 more sources
An efficient algorithm for multi-item scheduling
Operations Research, 1971A number of resource-allocation problems, including that of multi-item scheduling, may be solved approximately as large linear programs, as in Manne [Management Sci. 4, 115–135 (1958)]. Dzielinski and Gomory [Management Sci. 11, 874–890 (1965)] applied the Dantzig-Wolfe decomposition principle to this problem.
Leon S. Lasdon, R. C. Terjung
openaire +1 more source
Constructing efficient election algorithms from efficient traversal algorithms
1988Traversal and Election are two foundamental tasks in distributed systems. A traversal algorithm enables a processor to send a message from node to node around the system. An election algorithm ends with some processor in a distinguished state (the leader).
openaire +1 more source