Sciweavers

1983 search results - page 257 / 397
» Competitive graph searches
Sort
View
LION
2010
Springer
188views Optimization» more  LION 2010»
14 years 1 months ago
Grapheur: A Software Architecture for Reactive and Interactive Optimization
Abstract This paper proposes a flexible software architecture for interactive multiobjective optimization, with a user interface for visualizing the results and facilitating the s...
Mauro Brunato, Roberto Battiti
ECAI
2008
Springer
13 years 10 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
IJRR
2010
115views more  IJRR 2010»
13 years 5 months ago
Improving the Efficiency of Clearing with Multi-agent Teams
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
Geoffrey Hollinger, Sanjiv Singh, Athanasios Kehag...
SIGIR
2012
ACM
11 years 10 months ago
Fighting against web spam: a novel propagation method based on click-through data
Combating Web spam is one of the greatest challenges for Web search engines. State-of-the-art anti-spam techniques focus mainly on detecting varieties of spam strategies, such as ...
Chao Wei, Yiqun Liu, Min Zhang, Shaoping Ma, Liyun...
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
14 years 9 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri