Sciweavers

1612 search results - page 91 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
119
Voted
CP
2004
Springer
15 years 7 months ago
Understanding Random SAT: Beyond the Clauses-to-Variables Ratio
It is well known that the ratio of the number of clauses to the number of variables in a random k-SAT instance is highly correlated with the instance’s empirical hardness. We con...
Eugene Nudelman, Kevin Leyton-Brown, Holger H. Hoo...
201
Voted
SIGMOD
2007
ACM
112views Database» more  SIGMOD 2007»
16 years 2 months ago
A random walk approach to sampling hidden databases
A large part of the data on the World Wide Web is hidden behind form-like interfaces. These interfaces interact with a hidden backend database to provide answers to user queries. ...
Arjun Dasgupta, Gautam Das, Heikki Mannila
ATAL
2009
Springer
15 years 9 months ago
Analyzing the performance of randomized information sharing
In large, collaborative, heterogeneous teams, team members often collect information that is useful to other members of the team. Recognizing the utility of such information and d...
Prasanna Velagapudi, Oleg A. Prokopyev, Katia P. S...
ARC
2009
Springer
188views Hardware» more  ARC 2009»
15 years 9 months ago
Word-Length Optimization and Error Analysis of a Multivariate Gaussian Random Number Generator
Abstract. Monte Carlo simulation is one of the most widely used techniques for computationally intensive simulations in mathematical analysis and modeling. A multivariate Gaussian ...
Chalermpol Saiprasert, Christos-Savvas Bouganis, G...
134
Voted
ICDCSW
2008
IEEE
15 years 8 months ago
Heuristic Relay Node Selection Algorithm for One-Hop Overlay Routing
—This paper reviews the characteristics of overlay networks and defines effective relay nodes that can improve the performance of interactive real-time applications. A heuristic ...
Yin Chen, Li Tang, Jun Li