387 search results - page 50 / 78 » Studying trailfinding algorithms for enhanced web search |
108
click to vote
JSAT
2008
14 years 11 months ago
2008
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
WWW
2007
ACM
16 years 15 days ago
2007
ACM
We present a family of measures of proximity of an arbitrary node in a directed graph to a pre-specified subset of nodes, called the anchor. Our measures are based on three differ...
WWW
2009
ACM
16 years 15 days ago
2009
ACM
We tackle the problem of disambiguating entities on the Web. We propose a user-driven scheme where graphs of entities ? represented by globally identifiable declarative artifacts ...
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
We have studied the problem of linking event information across different languages without the use of translation systems or dictionaries. The linking is based on interlingua in...