Changes To Application Example: Distributed Search Engine
Not logged in

Changes to "Application Example: Distributed Search Engine" between 2016-09-03 02:21:49 and 2016-09-03 02:23:48

    34     34   <p>Each node maintains its own, personal, table of node reputations. The query
    35     35   initiator asks the packet owner directly for the packet and verifies that the
    36     36   promised distance between the query and the packet match. In terms of search
    37     37   hops the nodes closer to the liar get higher penalty points than the nodes
    38     38   further from the liar. The rest is a matter of custom heuristics that can be
    39     39   very creative. The liars might lie only occasionally, at random moments or
    40     40   according to some heuristic or statistical distribution, according to
    41         -instructions from censors, etc.</p>
           41  +instructions from censors, etc. The search engine might work on text, but the
           42  +algorithm works also on other data types, for example, 3D shapes, maps, images,
           43  +sounds, etc.</p>
    42     44   
    43     45   <p><br>
    44     46   </p>
    45     47   
    46     48   <h1>Sources of Inspiration</h1>
    47     49   
    48     50   <p></p>