1259 search results - page 141 / 252 » In search of the memoryless property |
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
We present improved lower bounds on the sizes of small maximal partial ovoids in the classical hermitian polar spaces, and improved upper bounds on the sizes of large maximal part...
ISW
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we present free-start collisions for the TIB3 hash function with a complexity of about 232 compression function evaluations. By using message modification technique...
IWANN
2009
Springer
14 years 2 months ago
2009
Springer
—This paper describes a multi-agent based simulation (MABS) framework to construct an artificial electric power market populated with learning agents. The artificial market, na...
SAT
2009
Springer
14 years 2 months ago
2009
Springer
The concept of backdoor variables has been introduced as a structural property of combinatorial problems that provides insight into the surprising ability of modern satisfiability...