5,532 research outputs found
Front Matter, Table of Contents, Preface, Conference Organization
No full textFront Matter, Table of Contents, Preface, Conference Organizatio
LIPIcs, Volume 209, DISC 2021, Complete Volume
No full textLIPIcs, Volume 209, DISC 2021, Complete Volum
Annual budget (Gilbert, Ariz.)
No full textabstract: The budget includes a profile of Gilbert and its government, a financial overview, details of operating and non-operating funds, capital improvement, and the town's deb
Gilbert Police Department annual report
No full textabstract: A report on the organization and activities of the Gilbert Police Departmen
Comprehensive annual financial report year ended June 30 (Gilbert, Ariz.)
No full textabstract: A complete set of audited financial statements for the town of Gilbert, Arizon
32. Schein (Seth L.), The lambic Trimeter in Aeschylus and Sophocles. A Study in Metrical Form
No full textAncher Gilbert P. 32. Schein (Seth L.), The lambic Trimeter in Aeschylus and Sophocles. A Study in Metrical Form. In: Revue des Études Grecques, tome 94, fascicule 447-449, Juillet-décembre 1981. pp. 566-567
Parallel Finger Search Structures
Get PDFIn this paper we present two versions of a parallel finger structure FS on p processors that supports searches, insertions and deletions, and has a finger at each end. This is to our knowledge the first implementation of a parallel search structure that is work-optimal with respect to the finger bound and yet has very good parallelism (within a factor of O(log p)^2) of optimal). We utilize an extended implicit batching framework that transparently facilitates the use of FS by any parallel program P that is modelled by a dynamically generated DAG D where each node is either a unit-time instruction or a call to FS.
The work done by FS is bounded by the finger bound F_L (for some linearization L of D), i.e. each operation on an item with distance r from a finger takes O(log r+1) amortized work. Running P using the simpler version takes O((T_1+F_L)/p + T_infty + d * ((log p)^2 + log n)) time on a greedy scheduler, where T_1, T_infty are the size and span of D respectively, and n is the maximum number of items in FS, and d is the maximum number of calls to FS along any path in D. Using the faster version, this is reduced to O((T_1+F_L)/p + T_infty + d *(log p)^2 + s_L) time, where s_L is the weighted span of D where each call to FS is weighted by its cost according to F_L. FS can be extended to a fixed number of movable fingers.
The data structures in our paper fit into the dynamic multithreading paradigm, and their performance bounds are directly composable with other data structures given in the same paradigm. Also, the results can be translated to practical implementations using work-stealing schedulers
Correspondence, John Brown to Seth Thompson, June 16, 1831
No full textA letter to Seth Thompson from John Brown regarding a receipt for Mr. Gilbert. 2 pages
Town of Gilbert heads-of-households survey : attitudes on planning and services 2010
Get PDFabstract: The results of a late 2010 telephone survey of 502 residents of Gilbert, to determine resident attitudes to growth and development, town policies, allocation of tax dollars, town services and general satisfaction with the quality of life in Gilbert, Arizon
Complexity at the social science interface
No full textThis paper introduces a special issue of Complexity dedicated to the increasingly important element of complexity science that engages with social policy. We introduce and frame an emerging research agenda that seeks to enhance social policy by working at the interface between the social sciences and the physical sciences (including mathematics and computer science), and term this research area the “social science interface” by analogy with research at the life sciences interface. We locate and exemplify the contribution of complexity science at this new interface before summarising the contributions collected in this special issue and identifying some common themes that run through them
- …
