950 search results - page 100 / 190 » Modified global k |
186
click to vote
SPAA
2009
ACM
16 years 3 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...
192
click to vote
FOCS
2008
IEEE
16 years 19 days 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...
207
click to vote
ANTSW
2004
Springer
15 years 10 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...
138
click to vote
SSS
2005
Springer
15 years 11 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...
158
click to vote
EC
2008
15 years 6 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...