5316 search results - page 245 / 1064 » Which Search Problems Are Random |
143
click to vote
TPDS
2002
15 years 4 months ago
2002
Speculative prefetching has been proposed to improve the response time of network access. Previous studies in speculative prefetching focus on building and evaluating access models...
150
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
This paper presents a gregarious particle swarm optimization algorithm (G-PSO) in which the particles explore the search space by aggressively scouting the local minima with the h...
116
Voted
ECML
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. In their search through a huge space of possible hypotheses, rule induction algorithms compare estimations of qualities of a large number of rules to find the one that ap...
127
click to vote
COMPSAC
2006
IEEE
15 years 11 months ago
2006
IEEE
Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for finding such arrays. Then a SAT-based approach a...
157
click to vote
DASFAA
2006
IEEE
15 years 11 months ago
2006
IEEE
Keyword search is an effective approach for most users to search for information because they do not need to learn complex query languages or the underlying structures of the data....