3495 search results - page 271 / 699 » On the random satisfiable process |
207
click to vote
EDBT
2010
ACM
15 years 10 months ago
2010
ACM
Data mining is increasingly performed by people who are not computer scientists or professional programmers. It is often done as an iterative process involving multiple ad-hoc tas...
175
click to vote
EPEW
2006
Springer
15 years 11 months ago
2006
Springer
We propose new techniques to simplify the computation of the cycle times and the absorption times for a large class of PEPA models. These techniques allow us to simplify the model ...
180
click to vote
MASCOTS
2004
15 years 8 months ago
2004
The accurate and efficient modeling of Internet worms is a particularly challenging task for network simulation tools. The atypical and aggressive behavior of these worms can easi...
153
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
We propose a discrete variant of the Bak-Sneppen model for self-organized criticality. In this process, a configuration is an n-bit word, and at each step one chooses a random bit...
135
Voted
DCG
2010
15 years 7 months ago
2010
In the random mosaic generated by a stationary Poisson hyperplane process in Rd , we consider the typical k-face weighted by the j-dimensional volume of the j-skeleton (0 j k d)...