2924 search results - page 549 / 585 » Lower Bounds in Distributed Computing |
175
click to vote
ICNP
1997
IEEE
15 years 10 months ago
1997
IEEE
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inh...
182
click to vote
ICDCS
2010
IEEE
15 years 10 months ago
2010
IEEE
In recent years, we have seen a surge of interest in enabling communications over meshed wireless networks. Particularly, supporting peer-to-peer communications over a multi-hop w...
185
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
167
click to vote
BTW
2007
Springer
16 years 22 days ago
2007
Springer
: Statistics that accurately describe the distribution of data values in the columns of relational tables are essential for effective query optimization in a database management sy...
197
click to vote
CPHYSICS
2006
15 years 6 months ago
2006
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...