Sciweavers

1205 search results - page 109 / 241
» On P Systems with Bounded Parallelism
Sort
View
IPPS
2008
IEEE
16 years 18 days ago
On the need for query-centric unstructured peer-to-peer overlays
—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...
William Acosta, Surendar Chandra
JC
2008
77views more  JC 2008»
15 years 6 months ago
A numerical algorithm for zero counting, I: Complexity and accuracy
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...
Felipe Cucker, Teresa Krick, Gregorio Malajovich, ...
CDC
2009
IEEE
149views Control Systems» more  CDC 2009»
15 years 11 months ago
A constant-factor approximately optimal solution to the Witsenhausen counterexample
Abstract— Despite its simplicity (two controllers and otherwise LQG), Witsenhausen’s counterexample is one of the long-standing open problems in stochastic distributed control....
Se Yong Park, Pulkit Grover, Anant Sahai
FSTTCS
2005
Springer
15 years 11 months ago
The MSO Theory of Connectedly Communicating Processes
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 ...
P. Madhusudan, P. S. Thiagarajan, Shaofa Yang
OPODIS
2010
15 years 4 months ago
Application of Random Walks to Decentralized Recommender Systems
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...
Anne-Marie Kermarrec, Vincent Leroy, Afshin Moin, ...