Sciweavers

2519 search results - page 167 / 504
» Martingales and Locality in Distributed Computing
Sort
View
HPCA
1998
IEEE
14 years 1 months ago
Non-Stalling CounterFlow Architecture
The counterflow pipeline concept was originated by Sproull et al.[1] to demonstrate the concept of asynchronous circuits. This architecture relies on distributed decision making an...
Michael F. Miller, Kenneth J. Janik, Shih-Lien Lu
SPAA
2009
ACM
14 years 4 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
ACS
2011
13 years 5 months ago
The Patch Construction is Dual to Algebraic DCPO Representation
Using the parallel between the preframe and the suplattice approach to locale theory it is shown that the patch construction, as an action on topologies, is the same thing as the ...
Christopher F. Townsend
ATAL
2006
Springer
14 years 1 months ago
Winning back the CUP for distributed POMDPs: planning over continuous belief spaces
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
Pradeep Varakantham, Ranjit Nair, Milind Tambe, Ma...
HIPC
2004
Springer
14 years 3 months ago
A-FAST: Autonomous Flow Approach to Scheduling Tasks
Abstract. This paper investigates the problem of autonomously allocating a large number of independent, equal sized tasks on a distributed heterogeneous grid-like platform, using o...
Sagnik Nandy, Larry Carter, Jeanne Ferrante