2370 search results - page 50 / 474 » The Characterization of Data-Accumulating Algorithms |
115
Voted
ICDCS
2009
IEEE
16 years 25 days ago
2009
IEEE
Autonomous routing algorithms, such as BGP, are intended to reach a globally consistent set of routes after nodes iteratively and independently collect, process, and share network...
91
Voted
IJCAI
2003
15 years 5 months ago
2003
The structural rigidity property, a generalization of Laman’s theorem which characterizes rigid bar frameworks in 2D, is generally considered a good approximation of rigidity in...
110
Voted
FSTTCS
2007
Springer
15 years 9 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
128
Voted
MP
2010
15 years 2 months ago
2010
Abstract; Dedicated to Alan J. Hoffman Ball et al. propose a graph model for material compatibility constraints for products such as PCs made from components, where each componen...
135
Voted
WEBI
2007
Springer
15 years 9 months ago
2007
Springer
Web sites are often organized into several regions, each dedicated to a specific topic or serving a particular function. From a user’s perspective, these regions typically form ...