Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,276,762 papers from all fields of science
Search
Sign In
Create Free Account
Fair computational tree logic
Fair computational tree logic is conventional computational tree logic studied with explicit fairness constraints.
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
2 relations
Strongly connected component
Broader (1)
Temporal logic
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
An algorithm on fairness verification of mobile sink routing in wireless sensor network
Guangquan Xu
,
Weisheng Li
,
+5 authors
Jia Mei
Personal and Ubiquitous Computing
2012
Corpus ID: 254085973
Congestion and starvation will occur among some nodes due to the emerging serious unfairness, which is derived from the limited…
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