Sciweavers

3131 search results - page 49 / 627
» Generalized connection caching
Sort
View
ICPP
1995
IEEE
14 years 7 days ago
Generalized Algorithm for Parallel Sorting on Product Networks
If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...
Antonio Fernández, Nancy Eleser, Kemal Efe
JSC
2010
96views more  JSC 2010»
13 years 7 months ago
On a generalization of Stickelberger's Theorem
We prove two versions of Stickelberger’s Theorem for positive dimensions and use them to compute the connected and irreducible components of a complex algebraic variety. If the ...
Peter Scheiblechner
IPPS
2010
IEEE
13 years 6 months ago
A general algorithm for detecting faults under the comparison diagnosis model
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
Iain A. Stewart
ATAL
2009
Springer
14 years 3 months ago
Caching schemes for DCOP search algorithms
Distributed Constraint Optimization (DCOP) is useful for solving agent-coordination problems. Any-space DCOP search algorithms require only a small amount of memory but can be spe...
William Yeoh, Pradeep Varakantham, Sven Koenig
CASCON
2001
79views Education» more  CASCON 2001»
13 years 10 months ago
On staleness and the delivery of web pages
A popular technique to improve the scalability of a web based system is caching at proxy servers. Caching has the drawback that a cached page becomes stale when the page is update...
Johnny W. Wong, David Evans, Michael Kwok