4103 search results - page 69 / 821 » Some results on the Collatz problem |
101
click to vote
COCO
2008
Springer
15 years 1 months ago
2008
Springer
![Amplifying ZPP^SAT[1] and the Two Queries Problem](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Amplifying ZPP^SAT[1] and the Two Queries Problem")
This paper shows a complete upward collapse in the Polynomial Hierarchy (PH) if for ZPP, two queries to a SAT oracle is equivalent to one query. That is, ZPPSAT[1] = ZPPSAT [2] = ...
ICMLA
2004
15 years 1 months ago
2004
In some environments, a learning agent must learn to balance competing objectives. For example, a Q-learner agent may need to learn which choices expose the agent to risk and whic...
JSAT
2006
14 years 11 months ago
2006
Many SAT instances can be decomposed into connected components either initially after preprocessing or during the solution phase when new unit conflict clauses are learned. This o...
JSW
2007
14 years 11 months ago
2007
— The anomaly-based intrusion detection systems examine current system activity do find deviations from normal system activity. The present paper proposes a method for normal act...
TIT
1998
14 years 11 months ago
1998
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...