Sciweavers

1756 search results - page 169 / 352
» Directed scale-free graphs
Sort
View
ICSE
1995
IEEE-ACM
13 years 11 months ago
A Framework for Selective Recompilation in the Presence of Complex Intermodule Dependencies
Compilers and other programming environment tools derive information from the source code of programs; derived information includes compiled code, interprocedural summary informat...
Craig Chambers, Jeffrey Dean, David Grove
COCOON
2008
Springer
13 years 10 months ago
Spreading Messages
Abstract. We model a network in which messages spread by a simple directed graph G = (V, E) [1] and a function : V N mapping each v V to a positive integer less than or equal to...
Ching-Lueh Chang, Yuh-Dauh Lyuu
ARSCOM
1998
104views more  ARSCOM 1998»
13 years 8 months ago
A Note on the Road-Coloring Conjecture
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a gra...
E. Gocka, Walter W. Kirchherr, Edward F. Schmeiche...
SIAMCOMP
2010
97views more  SIAMCOMP 2010»
13 years 6 months ago
Designing Network Protocols for Good Equilibria
Designing and deploying a network protocol determines the rules by which end users interact with each other and with the network. We consider the problem of designing a protocol t...
Ho-Lin Chen, Tim Roughgarden, Gregory Valiant
CORR
2011
Springer
136views Education» more  CORR 2011»
13 years 3 months ago
Degree Fluctuations and the Convergence Time of Consensus Algorithms
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the deg...
Alexander Olshevsky, John N. Tsitsiklis