Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,295 papers from all fields of science
Search
Sign In
Create Free Account
Goal node (computer science)
Known as:
Goal node
, Node
In computer science, a goal node is a node in a graph that meets defined criteria for success or termination. Heuristical artificial intelligence…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Artificial intelligence
Computer science
Graph (discrete mathematics)
Node (computer science)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Performance analysis of Opportunistic Network Protocols in BlackHole Environment
D. Sharma
,
M. S. Ahmad
,
Himanshu Garg
,
Kshitij Sharma
International Conference Inventive Communication…
2018
Corpus ID: 52900595
In Opportunistic Networks (OppNets), there is no predetermined route from source to destination. Whereas in MANETs (Mobile Ad-Hoc…
Expand
2014
2014
EMPLOYEE PERFORMANCE EVALUATION USING MACHINE LEARNING ALGORITHM
Final Year
2014
Corpus ID: 63350967
The main objective is to provide the performance appraisal report of an employee using Decision Tree algorithm. The data mining…
Expand
2013
2013
An Improved Social Network Analysis Method for Social Networks
Jongsoo Sohn
,
Daehyun Kang
,
Hansaem Park
,
Bok-Gyu Joo
,
In-Jeong Chung
EMC/HumanCom
2013
Corpus ID: 45302438
Recently, Social Network Service (SNS) users are rapidly increasing, and Social Network Analysis (SNA) methods are used to…
Expand
2010
2010
An improved PSO for path planning of mobile robots and its parameters discussion
Yong Tang
,
Qing Li
,
Lijun Wang
,
Chao Zhang
,
Yixin Yin
International Conference on Intelligent Control…
2010
Corpus ID: 16525234
An improved path planning algorithm for mobile robot in known environment is presented in this paper. Firstly, the environment…
Expand
2008
2008
An Novel Energy-Efficient Minimum Routing Algorithm (EEMR) in Wireless Sensor Networks
Ming Zhang
,
Suoping Wang
,
Chao Liu
,
Huibin Feng
International Conference on Wireless…
2008
Corpus ID: 2958930
One of the key problems for wireless sensor networks (WSNs) is the design of energy-efficient routing algorithm, because sensor…
Expand
2006
2006
A diagrammatic proof search procedure as part of a formal approach to problem solving.
D. Batens
2006
Corpus ID: 13547227
This paper aims at describing a goal-directed and diagrammatic method for proof search. The method (and one of the logics…
Expand
2000
2000
Stochastically Generated Trees and Non-Linear Time-Cost 1
L. Steinberg
2000
Corpus ID: 15191253
This Statement of Interest will discuss three aspects of the work at Rutgers on utility-guided search: the class of problems we…
Expand
1998
1998
Stochastic node caching for memory-bounded search
Teruhisa Miura
,
T. Ishida
Systems and Computers in Japan
1998
Corpus ID: 14922403
Linear-space search algorithms such as IDA* (Iterative Deepening A*) cache only those nodes on the current search path, but may…
Expand
1995
1995
A best-first search algorithm guided by a set-valued heuristic
J. Lark
,
C. White
,
Kirsten Syverson
IEEE Transactions on Systems, Man and Cybernetics
1995
Corpus ID: 45714357
Presents an algorithm, called A/sup G/, for finding the least-cost path from start node to goal node set in an OR-graph, where…
Expand
1995
1995
Utility of Pathmax in Partial Order Heuristic Search
P. Dasgupta
,
P. Chakrabarti
,
S. DeSarkar
Information Processing Letters
1995
Corpus ID: 9440852
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