Heuristics used by HERBY for semantic tree theorem proving | 3 | 0.54 | 1998 |
The Practicality Of Generating Semantic Trees For Proofs Of Unsatisfiability | 2 | 0.41 | 1996 |
An Upper Bound on the Time Complexity of Iterative-Deepening-A | 5 | 0.54 | 1992 |
Computer Chess: Ten Years of Significant Progress | 0 | 0.34 | 1989 |
The 18th ACM's North American Computer-Chess Championship. | 0 | 0.34 | 1987 |
A Hypothesis concerning the Strength of Chess Programs. | 0 | 0.34 | 1985 |
A parallel search chess program | 12 | 2.09 | 1985 |
The Forthcoming Triennial Meeting. | 0 | 0.34 | 1985 |
News, Information, Tournaments and Reports. | 0 | 0.34 | 1984 |
Dues, Membership and the Next World Championship. | 0 | 0.34 | 1984 |
Computer chess: Master level play in 1981? | 0 | 0.34 | 1981 |
Optimal crossing-free Hamiltonian circuit drawings of Kn | 14 | 2.08 | 1980 |
JCIT hosts Israel's first major computer chess tournament | 0 | 0.34 | 1980 |
Recent Progress in Computer Chess | 7 | 3.17 | 1979 |
Computer Chess: Recent Progress and Future Expectations | 2 | 1.82 | 1978 |
The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores | 25 | 19.41 | 1977 |
The principal continuation and the killer heuristic. | 47 | 4.91 | 1977 |
SIGTPC (Panel Session) | 0 | 0.34 | 1976 |
General interest (Paper Session) | 0 | 0.34 | 1976 |
A Study of Trigger Machines | 0 | 0.34 | 1973 |
Universal Modules for Bounded Signal Fan-Out Synchronous Sequential Circuits | 7 | 0.87 | 1972 |
Iteratively Realized Sequential Circuits | 15 | 2.02 | 1970 |
Iteratively realized sequential circuits: Further considerations | 2 | 0.47 | 1969 |
Maximal Memory Binary Input-Binary Output Finite-Memory Sequential Machines | 7 | 1.15 | 1968 |
Uniform modular realization of sequential machines | 8 | 0.89 | 1968 |
A Synthesis Technique for Binary Input-Binary Output Synchronous Sequential Moore Machines | 16 | 2.56 | 1968 |
Note on Binary Input-Binary Output Finite-Memory Sequential Machines | 5 | 0.84 | 1967 |