Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,984,594 papers from all fields of science
Search
Sign In
Create Free Account
Node (computer science)
Known as:
Node
, Node (programming)
A node is a basic unit used in computer science. Nodes are devices or data points on a larger network. Devices such as a personal computer, cell…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Application programming interface
Association list
Autodesk Maya
Bauhaus Project (computing)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Incorporating Data from Multiple Sensors for Localizing Nodes in Mobile Ad Hoc Networks
Rui Huang
,
G. Záruba
IEEE Transactions on Mobile Computing
2007
Corpus ID: 2730877
The ad hoc network localization problem deals with estimating the geographical location of all nodes in an ad hoc network…
Expand
2003
2003
On the Complexity of Distributed Self-Configuration in Wireless Networks
B. Krishnamachari
,
S. Wicker
,
R. Béjar
,
C. Fernández
Telecommunications Systems
2003
Corpus ID: 3190996
We consider three distributed configuration tasks that arise in the setup and operation of multi-hop wireless networks: partition…
Expand
Highly Cited
2000
Highly Cited
2000
Fault-tolerant execution of mobile agents
L. Silva
,
Victor Batista
,
J. G. Silva
Proceeding International Conference on Dependable…
2000
Corpus ID: 7686657
In this paper, we will address the list of problems that have to be solved in mobile agent systems and we will present a set of…
Expand
Highly Cited
2000
Highly Cited
2000
Self-configuring networks
A. Mcauley
,
K. Manousakis
MILCOM Proceedings. 21st Century Military…
2000
Corpus ID: 62071440
To make future tactical battlefield networks more flexible and robust, nodes must rapidly configure themselves with little or no…
Expand
Highly Cited
2000
Highly Cited
2000
Fast dynamic reconfiguration in irregular networks
Olav Lysne
,
J. Duato
Proceedings of the International Conference on…
2000
Corpus ID: 1578303
Exploitation of the wiring flexibility in Networks of Workstations demands configuration methods that can handle dynamic changes…
Expand
Highly Cited
1996
Highly Cited
1996
Mapping Ecological Land Systems and Classification Uncertainties from Digital Elevation and Forest-Cover Data Using Neural Networks
P. Gong
,
R. Pu
,
J. Chen
1996
Corpus ID: 53991763
Our approaches in this project emphasized mainly the technical aspects of the land-systems classification problem with neural…
Expand
Highly Cited
1995
Highly Cited
1995
BAHAMA: a broadband ad-hoc wireless ATM local-area network
K. Eng
,
M. Karol
,
+4 authors
Reinaldo A. Valenzuela
Proceedings IEEE International Conference on…
1995
Corpus ID: 62060653
We describe the theory, design and ongoing prototyping of a wireless ATM LAN/PBX capable of supporting mobile users with multi-Mb…
Expand
Highly Cited
1995
Highly Cited
1995
A wireless broadband ad-hoc ATM local-area network
K. Eng
,
M. Karol
,
+4 authors
R. Valenzuela
Wirel. Networks
1995
Corpus ID: 1339010
We describe the theory, design and ongoing prototyping of a wireless ATM LAN/PBX capable of supporting mobile users with multi-Mb…
Expand
Highly Cited
1990
Highly Cited
1990
Distributed Modal Identification and Vibration Control of Continua: Theory and Applications
H. Tzou
American Control Conference
1990
Corpus ID: 20103952
Conventional transducers and actuators are "discrete" in nature, i.e., they usually measure and control spatially discrete…
Expand
Highly Cited
1985
Highly Cited
1985
Fault-Tolerant Routing in DeBruijn Comrnunication Networks
A. Esfahanian
,
S. Hakimi
IEEE transactions on computers
1985
Corpus ID: 8854940
A class of communication networks which is suitable for "multiple processor systems" was studied by Pradhan and Reddy. The…
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