1402 search results - page 153 / 281 » Sparse-Memory Graph Search |
113
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
141
click to vote
SAC
2006
ACM
15 years 2 months ago
2006
ACM
Link farm spam and replicated pages can greatly deteriorate link-based ranking algorithms like HITS. In order to identify and neutralize link farm spam and replicated pages, we lo...
108
click to vote
AAAI
2007
15 years 4 months ago
2007
The paper presents and evaluates the power of best-first search over AND/OR search spaces in graphical models. The main virtue of the AND/OR representation is its sensitivity to ...
124
click to vote
SPAA
1990
ACM
15 years 6 months ago
1990
ACM
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...
130
Voted
SIGIR
2010
ACM
15 years 6 months ago
2010
ACM
It is generally believed that propagated anchor text is very important for effective Web search as offered by the commercial search engines. “Google Bombs” are a notable illus...