1631 search results - page 196 / 327 » Uniform Distributed Synthesis |
142
click to vote
ICNP
1999
IEEE
15 years 7 months ago
1999
IEEE
Providing quality of service (QoS) guarantees over wireless links requires thorough understanding and quantification of the interactions among the traffic source, the wireless cha...
165
Voted
SPAA
1994
ACM
15 years 7 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
155
click to vote
FCT
2007
Springer
15 years 7 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
136
Voted
DILS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Grid computing has great potential for supporting the integration of complex, fast changing biological data repositories to enable distributed data analysis. One scenario...
154
Voted
COCO
2008
Springer
15 years 5 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...