Results 241 to 250 of about 557,141 (262)
Some of the next articles are maybe not open access.

A space efficient distributive sort

Information Processing Letters, 1991
Distributive sorts operate by assigning each item to one of k buckets \((k=\lceil N/m\rceil\), \(1\leq m\leq 5)\). Typically they need k locations for bucket headers, plus N locations for the links, giving a total of \(N+N\lceil N/m\rceil\). Many methods (e.g. Uniform Sort \textit{D. C. S. Allison}, \textit{M. T.
openaire   +2 more sources

Efficient Spiral Search in Bounded Spaces

IEEE Transactions on Pattern Analysis and Machine Intelligence, 1982
This correspondence defines approaches for the efficient generation of a spiral-like search pattern within bounded rectangularly tessellated regions. The defined spiral-like search pattern grows outward from a given source in a two-dimensional space, thus tending to minimize search time in many sequential tracking tasks.
openaire   +3 more sources

Time-and space-efficient randomized consensus

Proceedings of the ninth annual ACM symposium on Principles of distributed computing, 1990
Abstract A protocol is presented which solves the randomized consensus problem [9] for shared memory. The protocol uses a total of O ( p 2 + n ) worst-case expected increment, decrement, and read operations on a set of three shared O (log n )-bit counters, where p is the number of active processors and n is the total number of processors.
openaire   +2 more sources

Space efficient processor identity protocol

Information Processing Letters, 1990
Computer Science ...
openaire   +1 more source

Space Efficiency in Contemporary Supertall Residential Buildings

Architecture, 2021
Huseyin Emre Ilgin, Ilgin Huseyin Emre
exaly  

Home - About - Disclaimer - Privacy