Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,220,486 papers from all fields of science
Search
Sign In
Create Free Account
Weak AI
Known as:
Applied AI
, Narrow AI
Weak AI (also known as narrow AI) is non-sentient artificial intelligence that is focused on one narrow task. Weak AI is defined in contrast to…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Artificial consciousness
Artificial general intelligence
Artificial intelligence in fiction
Behavior-based robotics
Expand
Broader (1)
Artificial intelligence
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
AdaBoost-SVM for Electrical Theft Detection and GRNN for Stealing Time Periods Identification
Rongli Wu
,
Liming Wang
,
Tianyu Hu
Annual Conference of the IEEE Industrial…
2018
Corpus ID: 57362881
Electric power companies lose $96 billion every year because of non-technical losses. Electrical theft is the main part of non…
Expand
2009
2009
Computational aspects of Shapley's saddles
F. Brandt
,
Markus Brill
,
Felix A. Fischer
,
Paul Harrenstein
Adaptive Agents and Multi-Agent Systems
2009
Corpus ID: 17789941
Game-theoretic solution concepts, such as Nash equilibrium, are playing an ever increasing role in the study of systems of…
Expand
2008
2008
Fast and Robust Face Detection Using Evolutionary Pruning
Jun-Su Jang
,
Jong-Hwan Kim
IEEE Transactions on Evolutionary Computation
2008
Corpus ID: 11488804
Face detection task can be considered as a classifier training problem. Finding the parameters of the classifier model by using…
Expand
Highly Cited
2004
Highly Cited
2004
The Zero-Information-Limit Condition and Spurious Inference in Weakly Identified Models
C. Nelson
,
R. Startz
2004
Corpus ID: 16716711
The fact that weak instruments lead to spurious inference is now widely recognized. In this paper we ask whether spurious…
Expand
2000
2000
On the Complexity of Bisimulation Problems for Basic Parallel Processes
Richard Mayr
International Colloquium on Automata, Languages…
2000
Corpus ID: 628647
Strong bisimilarity of Basic Parallel Processes (BPP) is decidable, but the best known algorithm has non-elementary complexity [7…
Expand
Highly Cited
1998
Highly Cited
1998
A unified treatment of quartic invariants at fixed and arbitrary energy
M. Karlovini
,
G. Pucacco
,
K. Rosquist
,
L. Samuelsson
1998
Corpus ID: 9423916
Two-dimensional Hamiltonian systems admitting second invariants which are quartic in the momenta are investigated using the…
Expand
1998
1998
Evaluation of the empirical performance of two-stage budgeting AIDS, QUAIDS and Rotterdam models based on weak separability
A. Decoster
,
Frederic Vermeulen
1998
Corpus ID: 16154925
Microsimulation models for indirect taxation require detailed underlying demand systems, in order to be policy relevant. A…
Expand
1994
1994
The syntax of "subjects"
立石 浩一
1994
Corpus ID: 116950361
1. Introduction 2. Strong SPEC(IP) subject hypothesis 3. Strong SPEC(VP) subject hypothesis 4. Weak SPEC(VP) subject hypothesis…
Expand
1984
1984
The Zeigarnik Phenomenon Revisited: Implications for Enhancement of Morale
B. Weybrew
1984
Corpus ID: 144589054
Zeigarnik's notion of need tension following task interruption was reexamined by comparing the time estimates of task-interrupted…
Expand
Highly Cited
1983
Highly Cited
1983
The localization transition on the Bethe lattice
H. Kunz
,
B. Souillard
1983
Corpus ID: 45841275
We present exact results concerning the localization transition on the Bethe lattice. In a certain number of situations, we prove…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE