Sciweavers

198 search results - page 31 / 40
» Tensor Rank: Some Lower and Upper Bounds
Sort
View
71
Voted
ICC
2009
IEEE
148views Communications» more  ICC 2009»
15 years 4 months ago
Analysis of Probabilistic Flooding: How Do We Choose the Right Coin?
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...
Sérgio Crisóstomo, Udo Schilcher, Ch...
CONCUR
1997
Springer
15 years 2 months ago
Reachability Analysis of Pushdown Automata: Application to Model-Checking
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...
Ahmed Bouajjani, Javier Esparza, Oded Maler
WDAG
2000
Springer
81views Algorithms» more  WDAG 2000»
15 years 1 months ago
Distributed Cooperation During the Absence of Communication
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...
Grzegorz Malewicz, Alexander Russell, Alexander A....
JACM
2008
90views more  JACM 2008»
14 years 10 months ago
Bit complexity of breaking and achieving symmetry in chains and rings
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...
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
IJCGA
2010
155views more  IJCGA 2010»
14 years 8 months ago
Competitive Complexity of Mobile Robot on-Line Motion Planning Problems
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 ...
Yoav Gabriely, Elon Rimon