Sciweavers

4998 search results - page 657 / 1000
» The case for intentional networking
Sort
View
176
Voted
CORR
2006
Springer
161views Education» more  CORR 2006»
15 years 6 months ago
Consensus Propagation
We propose consensus propagation, an asynchronous distributed protocol for averaging numbers across a network. We establish convergence, characterize the convergence rate for regul...
Ciamac Cyrus Moallemi, Benjamin Van Roy
DAM
2006
100views more  DAM 2006»
15 years 6 months ago
A combinatorial algorithm for weighted stable sets in bipartite graphs
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
Ulrich Faigle, Gereon Frahling
172
Voted
JPDC
2006
134views more  JPDC 2006»
15 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
STANDARDVIEW
1998
128views more  STANDARDVIEW 1998»
15 years 6 months ago
Compatibility, standards, and software production
Compatibility is a key strategic decision in software production. Proposals exist for standards in several fields of software production, such as networking (ISO and IEEE), operat...
Giancarlo Succi, Andrea Valerio, Tullio Vernazza, ...
PSYCHNOLOGY
2008
94views more  PSYCHNOLOGY 2008»
15 years 6 months ago
A Design Framework for Mapping Social Relationships
This paper describes a design framework for representing social-spatial data on maps and diagrams and then illustrates the design approaches for representing social data in two ap...
Alistair G. Sutcliffe