Sciweavers

636 search results - page 18 / 128
» Measuring Complexity of Intelligent Machines
Sort
View
FSTTCS
2004
Springer
15 years 3 months ago
Hardness Hypotheses, Derandomization, and Circuit Complexity
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
John M. Hitchcock, Aduri Pavan
75
Voted
ATAL
2004
Springer
15 years 3 months ago
The Insufficiency of Formal Design Methods - The Necessity of an Experimental Approach - for the Understanding and Control of Co
We highlight the limitations of formal methods by exhibiting two results in recursive function theory: that there is no effective means of finding a program that satisfies a given...
Bruce Edmonds, Joanna Bryson
AAAI
1997
14 years 11 months ago
Applications of Rule-Base Coverage Measures to Expert System Evaluation
Often a rule-based system is tested by checking its performance on a number of test cases with known solutions, modifying the system until it gives the correct results for all or ...
Valerie Barr
AAAI
2006
14 years 11 months ago
Towards Chemical Universal Turing Machines
Present developments in the natural sciences are providing enormous and challenging opportunities for various AI technologies to have an unprecedented impact in the broader scient...
Stephen Muggleton
TSP
2010
14 years 4 months ago
Single antenna power measurements based direction finding
Abstract--In this paper, the problem of estimating direction-ofarrival (DOA) of multiple uncorrelated sources from single antenna power measurements is addressed. Utilizing the fac...
Joni Polili Lie, Thierry Blu, Chong Meng Samson Se...