605 search results - page 57 / 121 » Probabilistic state space search |
WSDM
2010
ACM
14 years 6 months ago
2010
ACM
This article describes an application of the partially observable Markov (POM) model to the analysis of a large scale commercial web search log. Mathematically, POM is a variant o...
FLAIRS
2007
13 years 11 months ago
2007
Discovery of graphical models is NP-hard in general, which justifies using heuristics. We consider four commonly used heuristics. We summarize the underlying assumptions and anal...
LICS
2007
IEEE
14 years 3 months ago
2007
IEEE
We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a succ...
ICST
2009
IEEE
14 years 3 months ago
2009
IEEE
Constraint solving lies at the heart of several specification-based approaches to automated testing. Korat is a previously developed algorithm for solving constraints in Java pro...
POPL
2012
ACM
12 years 4 months ago
2012
ACM
This paper describes an executable formal semantics of C. Being executable, the semantics has been thoroughly tested against the GCC torture test suite and successfully passes 99....