Sciweavers

1631 search results - page 197 / 327
» Uniform Distributed Synthesis
Sort
View
WSC
1998
15 years 4 months ago
Communicating Structures for Modeling Large-scale Systems
ating Structures is a system abstraction that helps to model large-scale distributed systems, whose performance mostly depends on how well the data and messages traffic is organiz...
Vadim E. Kotov
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 4 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
CORR
2010
Springer
110views Education» more  CORR 2010»
15 years 3 months ago
Mixing Time and Stationary Expected Social Welfare of Logit Dynamics
We study logit dynamics [3] for strategic games. At every stage of the game a player is selected uniformly at random and she is assumed to play according to a noisy best-response ...
Vincenzo Auletta, Diodato Ferraioli, Francesco Pas...
114
Voted
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 3 months ago
Is Witsenhausen's counterexample a relevant toy?
This paper answers a question raised by Doyle on the relevance of the Witsenhausen counterexample as a toy decentralized control problem. The question has two sides, the first of w...
Pulkit Grover, Anant Sahai
EOR
2010
84views more  EOR 2010»
15 years 3 months ago
Worst-case analysis of demand point aggregation for the Euclidean p-median problem
Solving large-scale p-median problems is usually time consuming. People often aggregate the demand points in a large-scale p-median problem to reduce its problem size and make it ...
Lian Qi, Zuo-Jun Max Shen