4781 search results - page 260 / 957 » Online algorithms for network design |
178
Voted
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
150
click to vote
MOBICOM
2006
ACM
16 years 20 days ago
2006
ACM
Determining node positions is essential for many next-generation network functionalities. Previous localization algorithms lack correctness guarantees or require network density h...
166
click to vote
JPDC
2006
15 years 6 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
189
click to vote
DEXA
1998
Springer
15 years 11 months ago
1998
Springer
Intelligent agents and active databases have a number of common characteristics, the most important of which is that they both execute actions by firing rules upon events occurring...
189
click to vote
AUTOMATICA
2010
15 years 6 months ago
2010
This paper considers the average consensus problem on a network of digital links, and proposes algorithms based on pairwise "gossip" communications and updates. Through ...