400 search results - page 77 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
104
click to vote
PODC
2006
ACM
15 years 3 months ago
2006
ACM
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
TVLSI
2008
14 years 9 months ago
2008
Applications in computer networks often require high throughput access to large data structures for lookup and classification. While advanced algorithms exist to speed these search...
SPAA
2004
ACM
15 years 2 months ago
2004
ACM
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
INFOCOM
1997
IEEE
15 years 1 months ago
1997
IEEE
In noncooperative networks, resources are shared among selfish users, which optimize their individual performance measure. We consider the generic and practically important case o...
STACS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...