5138 search results - page 303 / 1028 » Randomized Algorithms for 3-SAT |
164
click to vote
AAAI
1998
15 years 8 months ago
1998
A Messy Genetic Algorithm is customized toflnd'optimal many-to-many matches for 2D line segment models. The Messy GA is a variant upon the Standard Genetic Algorithm in which...
190
click to vote
JGAA
2007
15 years 6 months ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
156
click to vote
JMLR
2010
15 years 1 months ago
2010
Logic-based probabilistic models (LBPMs) enable us to handle problems with uncertainty succinctly thanks to the expressive power of logic. However, most of LBPMs have restrictions...
254
click to vote
ICIP
2001
IEEE
16 years 8 months ago
2001
IEEE
The HMM (Hidden Markov Model) is a probabilistic model of the joint probability of a collection of random variables with both observations and states. The GMM (Gaussian Mixture Mo...
159
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...