Sciweavers

2996 search results - page 152 / 600
» Numberings and Randomness
Sort
View
HICSS
2000
IEEE
144views Biometrics» more  HICSS 2000»
15 years 10 months ago
Diffusion Follows Structure - A Network Model of the Software
By conducting simulations, we show that the structure of the personal networks significantly influences the diffusion processes in network effect markets like the software market....
Falk von Westarp, Oliver Wendt
AAAI
1997
15 years 6 months ago
Variable-Selection Heuristics in Local Search for SAT
One of the important components of a local search strategy for satisfiability testing is the variable selection heuristic, which determines the next variable to be flipped. In a...
Alex S. Fukunaga
RSA
2006
68views more  RSA 2006»
15 years 5 months ago
The probabilistic analysis of a greedy satisfiability algorithm
: On input a random 3-CNF formula of clauses-to-variables ratio r3 applies repeatedly the following simple heuristic: Set to True a literal that appears in the maximum number of cl...
Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios...
SAC
2005
ACM
15 years 11 months ago
Stochastic scheduling of active support vector learning algorithms
Active learning is a generic approach to accelerate training of classifiers in order to achieve a higher accuracy with a small number of training examples. In the past, simple ac...
Gaurav Pandey, Himanshu Gupta, Pabitra Mitra
SAT
2005
Springer
124views Hardware» more  SAT 2005»
15 years 11 months ago
An Improved Upper Bound for SAT
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1...
Evgeny Dantsin, Alexander Wolpert