Sciweavers

6393 search results - page 322 / 1279
» Randomized Algorithms on the Mesh
Sort
View
MSWIM
2006
ACM
16 years 19 days ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
164
Voted
ATAL
2006
Springer
15 years 10 months ago
Security in multiagent systems by policy randomization
Security in multiagent systems is commonly defined as the ability of the system to deal with intentional threats from other agents. This paper focuses on domains where such intent...
Praveen Paruchuri, Milind Tambe, Fernando Ord&oacu...
CPC
2007
95views more  CPC 2007»
15 years 6 months ago
Colouring Random Regular Graphs
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular...
Lingsheng Shi, Nicholas C. Wormald
JAIR
2007
95views more  JAIR 2007»
15 years 6 months ago
Consistency and Random Constraint Satisfaction Models
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
Yong Gao, Joseph C. Culberson
SODA
2012
ACM
195views Algorithms» more  SODA 2012»
13 years 9 months ago
Concentration and moment inequalities for polynomials of independent random variables
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
Warren Schudy, Maxim Sviridenko