Sciweavers

7228 search results - page 141 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
128
Voted
ICML
2010
IEEE
15 years 4 months ago
Efficient Selection of Multiple Bandit Arms: Theory and Practice
We consider the general, widely applicable problem of selecting from n real-valued random variables a subset of size m of those with the highest means, based on as few samples as ...
Shivaram Kalyanakrishnan, Peter Stone
DATE
2008
IEEE
113views Hardware» more  DATE 2008»
15 years 10 months ago
Random Stimulus Generation using Entropy and XOR Constraints
Despite the growing research effort in formal verification, constraint-based random simulation remains an integral part of design validation, especially for large design componen...
Stephen Plaza, Igor L. Markov, Valeria Bertacco
CACM
2008
131views more  CACM 2008»
15 years 3 months ago
Exterminator: Automatically correcting memory errors with high probability
Programs written in C and C++ are susceptible to memory errors, including buffer overflows and dangling pointers. These errors, which can lead to crashes, erroneous execution, and...
Gene Novark, Emery D. Berger, Benjamin G. Zorn
131
Voted
WWW
2004
ACM
16 years 4 months ago
Small world peer networks in distributed web search
In ongoing research, a collaborative peer network application is being proposed to address the scalability limitations of centralized search engines. Here we introduce a local ada...
Ruj Akavipat, Le-Shin Wu, Filippo Menczer
127
Voted
ACMSE
2006
ACM
15 years 9 months ago
Discovering communities in complex networks
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
Hemant Balakrishnan, Narsingh Deo