15254 search results - page 103 / 3051 » A k |
108
click to vote
JCP
2007
14 years 9 months ago
2007
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
JUCS
2007
14 years 9 months ago
2007
Abstract: We present a new type of sat problem called the k-gd-sat, which generalizes k-sat and gd-sat. In k-gd-sat, clause lengths have geometric distribution, controlled by a pro...
ARSCOM
2002
14 years 9 months ago
2002
COMCOM
2004
14 years 9 months ago
2004
CORR
2004
Springer
14 years 9 months ago
2004
Springer
It is usually assumed that Honeynets are hard to detect and that attempts to detect or disable them can be unconditionally monitored. We scrutinize this assumption and demonstrate ...