3495 search results - page 19 / 699 » On the random satisfiable process |
CDC
2008
IEEE
14 years 4 months ago
2008
IEEE
—We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooper...
Book
"From an applications viewpoint, the main reason to study the subject of these notes is to help deal with the complexity of describing random, time-varying functions. A random...
MMM
2008
Springer
14 years 4 months ago
2008
Springer
Abstract. With the explosive growth of multimedia data, video presentation has become an important technology for fast browsing of video content. In this paper, we present a novel ...
CIE
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The family of all Martin-L¨of random left-compu...
ECAI
2006
Springer
14 years 2 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...