1461 search results - page 28 / 293 » The Cost of Cache-Oblivious Searching |
AAAI
2007
15 years 2 months ago
2007
In a constraint optimization problem (COP), many feasible valuations lead to the same objective value. This often means a huge search space and poor performance in the propagation...
IJWIN
2007
14 years 11 months ago
2007
— We analyze the asymptotic cost of discovering a route within a flat ad hoc network and we show that one can discover a route with cost that is proportional only to the area of...
100
click to vote
IFIP12
2009
14 years 9 months ago
2009
In this paper we propose a web search methodology based on the Ant Colony Optimization (ACO) algorithm, which aims to enhance the amount of the relevant information in respect to a...
101
click to vote
MOBICOM
2004
ACM
15 years 5 months 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...
KDD
2000
ACM
15 years 3 months ago
2000
ACM
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...