3495 search results - page 55 / 699 » On the random satisfiable process |
CORR
2004
Springer
13 years 10 months ago
2004
Springer
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
The first part of our work is connected with the analysis of typical random variables for the specific human-initiated process. We study the data characterizing editorial work wit...
AAAI
1994
14 years 3 days ago
1994
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
TOCL
2008
13 years 10 months ago
2008
State Machines Capture Parallel Algorithms: Correction and Extension ANDREAS BLASS University of Michigan and YURI GUREVICH Microsoft Research We consider parallel algorithms worki...
ICIP
1998
IEEE
15 years 9 days ago
1998
IEEE
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...