72 search results - page 4 / 15 » Random search can outperform mutation |
CIVR
2010
Springer
15 years 1 days ago
2010
Springer
Most existing reranking approaches to image search focus solely on mining "visual" cues within the initial search results. However, the visual information cannot always ...
113
click to vote
ECML
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. This paper presents an empirical study of population diversity measure and adaptive control of diversity in the context of a permutation-based algorithm for Traveling Sal...
IEEEAMS
2003
IEEE
15 years 2 months ago
2003
IEEE
SHARK is a novel concept and middleware service for search in peer-to-peer (P2P) networks. Rather than flooding a network like Gnutella or imposing numerical IDs on objects like d...
AAAI
1996
14 years 11 months ago
1996
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
SIGIR
2009
ACM
15 years 4 months ago
2009
ACM
Recent work in supervised learning of term-based retrieval models has shown significantly improved accuracy can often be achieved via better model estimation [2, 10, 11, 17]. In ...