1205 search results - page 109 / 241 » On P Systems with Bounded Parallelism |
118
click to vote
IPPS
2008
IEEE
15 years 10 months ago
2008
IEEE
—Hybrid P2P systems rely on the assumption that sufficient objects exist nearby in order to make the unstructured search component efficient. This availability depends on the o...
112
Voted
JC
2008
15 years 3 months ago
2008
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(log(nD(f))) iterations (grid refinements) where n is...
144
Voted
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— Despite its simplicity (two controllers and otherwise LQG), Witsenhausen’s counterexample is one of the long-standing open problems in stochastic distributed control....
131
Voted
FSTTCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We identify a network of sequential processes that communicate by synchronizing frequently on common actions. More precisely, we demand that there is a bound k such that ...
147
Voted
OPODIS
2010
15 years 1 months ago
2010
The need for efficient decentralized recommender systems has been appreciated for some time, both for the intrinsic advantages of decentralization and the necessity of integrating...