Analysis of some algorithms of Web-sites searching (Q2782144)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Analysis of some algorithms of Web-sites searching |
scientific article; zbMATH DE number 1727612
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis of some algorithms of Web-sites searching |
scientific article; zbMATH DE number 1727612 |
Statements
14 April 2002
0 references
Polling systems
0 references
algorithms of Web-sites searching
0 references
Analysis of some algorithms of Web-sites searching (English)
0 references
The paper deals with a mathematical problem of servicing a finite (but large enough) number \(N\) of information sources (Web-sites) by one server (search engine). Such systems are called ``Polling systems'' (see [\textit{H.~Takagi}, ``Analysis of polling systems'', MIT Press, Cambridge (1986)]). The authors propose three algorithms of Web-sites searching and make their numerical comparison by means of the work immutation model of the corresponding search engine.
0 references
