9325 search results - page 102 / 1865 » The decentralized implementability problem |
107
click to vote
OPODIS
2007
15 years 4 months ago
2007
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
112
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
ICPP
1993
IEEE
15 years 7 months ago
1993
IEEE
Abstract { This paper presents a parallel algorithm for solving the region growing problem based on the split and merge approach. The algorithm was implemented on the CM-2 and the ...
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
—In this paper, we consider the control system Σ defined by the rolling of a strictly convex surface S of IR3 on a plane without slipping or spinning. The purpose of this paper...
137
click to vote
RULEML
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In this paper we present the well founded variants of ambiguity blocking and ambiguity propagating defeasible logics. We also show how to extend SPINdle, a state of the a...