Sciweavers

1402 search results - page 48 / 281
» Searching Cycle-Disjoint Graphs
Sort
View
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
14 years 11 months ago
Computing minimum cuts by randomized search heuristics
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...
Frank Neumann, Joachim Reichel, Martin Skutella
SAC
2006
ACM
14 years 9 months ago
Undue influence: eliminating the impact of link plagiarism on web search rankings
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...
Baoning Wu, Brian D. Davison
ICC
2007
IEEE
116views Communications» more  ICC 2007»
15 years 4 months ago
Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
Alejandra González Beltrán, Paul Sag...
GBRPR
2005
Springer
15 years 3 months ago
Reactive Tabu Search for Measuring Graph Similarity
Abstract. Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching...
Sébastien Sorlin, Christine Solnon
AAAI
2007
15 years 4 days ago
Best-First AND/OR Search for Graphical Models
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 ...
Radu Marinescu 0002, Rina Dechter