2004
DOI: 10.1109/tkde.2004.65
|View full text |Cite
|
Sign up to set email alerts
|

A modeling technique for the performance analysis of Web searching applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2006
2006
2021
2021

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(8 citation statements)
references
References 13 publications
0
8
0
Order By: Relevance
“…[6] proposed a mobile multi-agent network model based on the generalized stochastic Petri-net. The Petri-net model was also used in [21] for investigating the performances of the client/server approach, remote-evaluation approach and mobile-agent approach in information retrieval application. [5] compared the energy consumption and the query response time between client/server approach and mobile agent approach for information retrieval, [19] compared these two approaches for network management, [4] compared these two approaches in component cost and migration cost, and [24] compared these two approaches for workflow systems.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…[6] proposed a mobile multi-agent network model based on the generalized stochastic Petri-net. The Petri-net model was also used in [21] for investigating the performances of the client/server approach, remote-evaluation approach and mobile-agent approach in information retrieval application. [5] compared the energy consumption and the query response time between client/server approach and mobile agent approach for information retrieval, [19] compared these two approaches for network management, [4] compared these two approaches in component cost and migration cost, and [24] compared these two approaches for workflow systems.…”
Section: Related Workmentioning
confidence: 99%
“…When the search agent completes its task on a server, it moves to the next one on its list and continues its execution. The search agent will return to the service server with a thorough report of its trip after it completes visiting all listed servers [1], [21].…”
Section: A Iqrmentioning
confidence: 99%
“…The similarity between two documents is measured by their cocitation degree. Backward cocitation degree: Two pages 1 p and 2 p are back cocited if they have a common parent page. The number of their common parent pages is their backward cocitation degree denoted as 1 2 ( , ) b p p .…”
Section: Citation and Cocitation Analysismentioning
confidence: 99%
“…The number of their common parent pages is their backward cocitation degree denoted as 1 2 ( , ) b p p . Forward cocitation degree: Two pages 1 p and 2 p are forward cocited if they have a common child page. The number of their common children is their forward cocitation degree, denoted as 1 2 ( , ) f p p .…”
Section: Citation and Cocitation Analysismentioning
confidence: 99%
See 1 more Smart Citation