3333 search results - page 159 / 667 » Abstract Proof Search |
108
click to vote
AAAI
2007
15 years 6 months ago
2007
Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAlleste...
125
click to vote
IJCAI
1989
15 years 5 months ago
1989
This paper describes an explanation-based approach lo learning plans despite a computationally intractable domain theory. In this approach, the system learns an initial plan using...
131
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
146
click to vote
SPIN
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Computational resources are increasing rapidly with the explosion of multi-core processors readily available from major vendors. Model checking needs to harness these res...
116
click to vote
ESORICS
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. We study the problem of authenticating the content and creation time of documents generated by an organization and retained in archival storage. Recent regulations (e.g.,...