Sciweavers

2479 search results - page 463 / 496
» Random Event Structures
Sort
View
ASPLOS
2004
ACM
14 years 1 months ago
Software prefetching for mark-sweep garbage collection: hardware analysis and software redesign
Tracing garbage collectors traverse references from live program variables, transitively tracing out the closure of live objects. Memory accesses incurred during tracing are essen...
Chen-Yong Cher, Antony L. Hosking, T. N. Vijaykuma...
PODC
2004
ACM
14 years 29 days ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
MPC
2010
Springer
181views Mathematics» more  MPC 2010»
14 years 10 days ago
Process Algebras for Collective Dynamics
d Abstract) Jane Hillston Laboratory for Foundations of Computer Science, The University of Edinburgh, Scotland Quantitative Analysis Stochastic process algebras extend classical p...
Jane Hillston
DESRIST
2009
Springer
143views Education» more  DESRIST 2009»
14 years 5 days ago
Designing for complex innovations in health care: design theory and realist evaluation combined
Innovations in health care are often characterized by complexity and fuzzy boundaries, involving both the elements of the innovation and the organizational structure required for ...
Christina Keller, Klas Gäre, Mats Edenius, St...
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
13 years 8 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount