CPC
1999
13 years 7 months ago
1999
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
AAAI
1997
13 years 8 months ago
1997
We show that a resealed constrainedness parameter provides the basis for accurate numerical models of search cost for both backtracking and local search algorithms. In the past, t...
ILP
2004
Springer
14 years 24 days ago
2004
Springer
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
MOBICOM
2004
ACM
14 years 26 days ago
2004
ACM
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
WIOPT
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless network. We consider the class of controlled flo...
HICSS
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper explores search behavior of online shoppers. Information economics literature suggests that search cost in electronic markets has essentially been reduced to zero as co...
TIME
2006
IEEE
14 years 1 months ago
2006
IEEE
An increasing number of documents in companies and other organizations are now only available electronically, and exist in several versions updated at different times. In order to...