1185 search results - page 91 / 237 » The Equivalence of Sampling and Searching |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Using a dynamic systems model for the Simple Genetic Algorithm due to Vose[1], we analyze the fixed point behavior of the model without crossover applied to functions of unitation...
ASPDAC
1999
ACM
14 years 6 days ago
1999
ACM
—This paper presents an efficient method to check the equivalence of two Boolean functions under permutation of the variables. The problem is also known as Boolean matching. As ...
FM
1994
Springer
13 years 12 months ago
1994
Springer
Model Checking of Infinite Specifications Daniel Jackson School of Computer Science Carnegie Mellon University Pittsburgh, PA A new method for analyzing specifications in languages...
CIIT
2007
13 years 9 months ago
2007
Given a list of filtering rules with individual hitting probabilities, it is known that the average processing time of a linear-search based firewall can be minimized by searchi...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
We cast model-free reinforcement learning as the problem of maximizing the likelihood of a probabilistic mixture model via sampling, addressing both the infinite and finite horizo...