Sciweavers

2370 search results - page 50 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
ICDCS
2009
IEEE
15 years 7 months ago
The Impact of Communication Models on Routing-Algorithm Convergence
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...
Aaron D. Jaggard, Vijay Ramachandran, Rebecca N. W...
IJCAI
2003
14 years 11 months ago
Algorithms for Identifying Rigid Subsystems in Geometric Constraint Systems
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...
Christophe Jermann, Bertrand Neveu, Gilles Trombet...
FSTTCS
2007
Springer
15 years 3 months ago
Undirected Graphs of Entanglement 2
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...
Walid Belkhir, Luigi Santocanale
MP
2010
99views more  MP 2010»
14 years 8 months ago
Separation, dimension, and facet algorithms for node flow polyhedra
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...
Maren Martens, S. Thomas McCormick, Maurice Queyra...
WEBI
2007
Springer
15 years 3 months ago
Detection of Web Subsites: Concepts, Algorithms, and Evaluation Issues
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 ...
Eduarda Mendes Rodrigues, Natasa Milic-Frayling, B...