995 search results - page 56 / 199 » complexity 2011 |
220
Voted
DCOSS
2011
Springer
14 years 2 months ago
2011
Springer
—Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly du...
137
Voted
FROCOS
2011
Springer
14 years 2 months ago
2011
Springer
One of the main shortcomings of the traditional methods for combining theories is the complexity of guessing the arrangement of the variables shared by the individual theories. Thi...
135
Voted
AUTOMATICA
2011
14 years 9 months ago
2011
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...
176
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Software testing is an expensive process, which is vital in the industry. Construction of the test-data in software testing requires the major cost and to decide which method to us...
135
Voted
MST
2011
14 years 9 months ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...