Sciweavers

4103 search results - page 322 / 821
» Some results on the Collatz problem
Sort
View
AI
1999
Springer
15 years 6 months ago
Computing a Representation of the Local Environment
Yeap [42] argued that an important basis for computing a cognitive map is the ability to compute and recognise local environments. Although he has demonstrated how such local envi...
Wai K. Yeap, Margaret E. Jefferies
CG
1999
Springer
15 years 6 months ago
Virtual reality as a tool for verification of assembly and maintenance processes
Business process re-engineering is becoming a main focus in today's efforts to overcome problems and deficits in the automotive and aerospace industries (e.g., integration in...
Antonino Gomes de Sá, Gabriel Zachmann
CJ
1999
126views more  CJ 1999»
15 years 6 months ago
Source Level Static Branch Prediction
The ability to predict the directions of branches, especially conditional branches, is an important problem in modern computer architecture and advanced compilers. Many static and...
W. F. Wong
JCT
2002
107views more  JCT 2002»
15 years 6 months ago
Asymmetric Binary Covering Codes
An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn such that every vector x Qn can be obtained from some vector c C by changing at most R...
Joshua N. Cooper, Robert B. Ellis, Andrew B. Kahng
CORR
1999
Springer
71views Education» more  CORR 1999»
15 years 6 months ago
New Error Bounds for Solomonoff Prediction
Solomonoff sequence prediction is a scheme to predict digits of binary strings without knowing the underlying probability distribution. We call a prediction scheme informed when i...
Marcus Hutter