3008 search results - page 127 / 602 » Independence in connected graphs |
207
click to vote
IWSOS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. A fundamental problem of future networks is to get fully selforganized routing protocols with good scalability properties that produce good paths in a wide range of netwo...
208
Voted
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— We consider the problem of throughput-optimal cross-layer design of wireless networks. We propose a joint congestion control and scheduling algorithm that achieves a fraction d...
166
click to vote
OTM
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We study large-scale distributed cooperative systems that use optimistic replication. We represent a system as a graph of actions (operations) connected by edges that rei...
205
Voted
INFOCOM
2003
IEEE
16 years 7 days ago
2003
IEEE
— Service discovery is an integral part of the ad hoc networking to achieve stand-alone and self-configurable communication networks. In this paper, we discuss possible service ...
182
Voted
SC
1991
ACM
15 years 10 months ago
1991
ACM
Kanada, Y., A method of vector processing for shared symbolic data, Parallel Computing, X (1993) XXX-XXX. Conventional processing techniques for pipelined vector processors such a...