Sciweavers

9325 search results - page 102 / 1865
» The decentralized implementability problem
Sort
View
OPODIS
2007
14 years 11 months ago
The Cost of Monotonicity in Distributed Graph Searching
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...
David Ilcinkas, Nicolas Nisse, David Soguet
CORR
2010
Springer
82views Education» more  CORR 2010»
14 years 10 months ago
Expansion and Search in Networks
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...
Arun S. Maiya, Tanya Y. Berger-Wolf
ICPP
1993
IEEE
15 years 2 months ago
Solving the Region Growing Problem on the Connection Machine
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 ...
Nawal Copty, Sanjay Ranka, Geoffrey Fox, Ravi V. S...
CDC
2009
IEEE
15 years 2 months ago
A motion planning algorithm for the rolling-body problem
—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...
François Alouges, Yacine Chitour, Ruixing L...
RULEML
2010
Springer
14 years 8 months ago
On the Problem of Computing Ambiguity Propagation and Well-Founded Semantics in Defeasible Logic
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...
Ho-Pun Lam, Guido Governatori