198 search results - page 31 / 40 » Tensor Rank: Some Lower and Upper Bounds |
163
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—This paper studies probabilistic information dissemination in random networks. Consider the following scenario: A node intends to deliver a message to all other nodes in...
208
click to vote
CONCUR
1997
Springer
15 years 10 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
161
click to vote
WDAG
2000
Springer
15 years 10 months ago
2000
Springer
This paper presents a study of a distributed cooperation problem under the assumption that processors may not be able to communicate for a prolonged time. The problem for n proces...
170
click to vote
JACM
2008
15 years 6 months ago
2008
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
197
click to vote
IJCGA
2010
15 years 5 months ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...