950 search results - page 100 / 190 » Modified global k |
SPAA
2009
ACM
14 years 7 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
ANTSW
2004
Springer
14 years 1 months ago
2004
Springer
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
SSS
2005
Springer
14 years 3 months ago
2005
Springer
This paper considers the self-stabilizing unison problem. The contribution of this paper is threefold. First, we establish that when any self-stabilizing asynchronous unison protoc...
EC
2008
13 years 10 months ago
2008
Abstract-- This paper presents a method for creating evaluation functions that efficiently promote coordination in a multiagent system, allowing single-agent evolutionary computati...