| http://www.w3.org/ns/prov#value | - The search tree or the search algorithm starts at the most significant bit uid[3] and probes successively, i.e. position by position, whether the single-wire communication network 100 has a slave node, e.g. 130, 150, 170, connected to it which has a specific binary value at the current or next position.
|
