Latent relational search is a new search paradigm based on the degree of analogy between two word pairs. A latent relational search engine is expected to return the word Paris as a...
Consumer health information is increasingly available online, but this vast amount of information is not necessarily accessible to general consumers. To design effective health in...
Yan Zhang, Peiling Wang, Amy Heaton, Heidi Winkler
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
We present GP-HH, a framework for evolving local-search 3-SAT heuristics based on GP. The aim is to obtain “disposable” heuristics which are evolved and used for a specific su...
Abstract. The coordinated reaction to a large-scale disaster is a challenging research problem. The Robocup rescue simulation league addresses this research problem but is currentl...