Sciweavers

548 search results - page 26 / 110
» Global value numbering using random interpretation
Sort
View
INFOSCALE
2006
ACM
15 years 3 months ago
Storage load balancing via local interactions among peers in unstructured P2P networks
— The present paper introduces a replication method that is meant to balance the storage load of peers in unstructured peer-to-peer (P2P) networks for file sharing and to provid...
Kei Ohnishi, Hiroshi Yamamoto, Kento Ichikawa, Mas...
FSTTCS
2006
Springer
15 years 1 months ago
Game Semantics for Higher-Order Concurrency
Abstract. We describe a denotational (game) semantics for a call-byvalue functional language with multiple threads of control, which may communicate values of general type on local...
James Laird
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
15 years 1 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
CORR
2011
Springer
133views Education» more  CORR 2011»
14 years 1 months ago
Minimizing the sum of many rational functions
We consider the problem of globally minimizing the sum of many rational functions over a given compact semialgebraic set. The number of terms can be large (10 to 100), the degree ...
Florian Bugarin, Didier Henrion, Jean B. Lasserre
RSA
2002
99views more  RSA 2002»
14 years 9 months ago
Distributed algorithms with dynamical random transitions
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...
Nadine Guillotin-Plantard, René Schott