Sciweavers

1686 search results - page 226 / 338
» Programs as polygraphs: computability and complexity
Sort
View
ICLP
1997
Springer
15 years 8 months ago
Total Homeostaticity and Integrity Constraints Restorability Recognition
We introduce and explore a property of deductive data bases with updates wich we call total homeostaticity, and which substantially generalizes the following their property: ”fo...
Michael I. Dekhtyar, Alexander Ja. Dikovsky
WSC
2007
15 years 6 months ago
Beyond the university: simulation education on the job
Simulation modelers have a diversity of educational backgrounds including several engineering and scientific disciplines, mathematics and computer related fields. Many of the skil...
Peter Tag, David Krahl
AAAI
2006
15 years 5 months ago
Exploring GnuGo's Evaluation Function with a SVM
While computers have defeated the best human players in many classic board games, progress in Go remains elusive. The large branching factor in the game makes traditional adversar...
Christopher Fellows, Yuri Malitsky, Gregory Wojtas...
CMG
2000
15 years 5 months ago
Comparing CPU Performance Between and Within Processor Families
Our study compares CPU performance on RISC and CISC uni and multiprocessors of varying speeds, and shows that the Instruction Set Architecture (ISA) style no longer matters. Our s...
Lee A. Butler, Travis Atkison, Ethan L. Miller
AAAI
1994
15 years 5 months ago
Small is Beautiful: A Brute-Force Approach to Learning First-Order Formulas
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
Steven Minton, Ian Underwood