Sciweavers

206 search results - page 31 / 42
» A Taxonomy of Cooperative Search Algorithms
Sort
View
CIKM
2011
Springer
12 years 7 months ago
Building directories for social tagging systems
Today, a number of algorithms exist for constructing tag hierarchies from social tagging data. While these algorithms were designed with ontological goals in mind, we know very li...
Denis Helic, Markus Strohmaier
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
13 years 11 months ago
Parisian evolution with honeybees for three-dimensional reconstruction
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
Gustavo Olague, Cesar Puente
TIP
2010
88views more  TIP 2010»
13 years 2 months ago
Efficient Stereoscopic Ranging via Stochastic Sampling of Match Quality
We present an efficient method that computes dense stereo correspondences by stochastically sampling match quality values. Nonexhaustive sampling facilitates the use of quality met...
Thayne Richard Coffman, Alan Conrad Bovik
CORR
2011
Springer
208views Education» more  CORR 2011»
13 years 2 months ago
GRASP and path-relinking for Coalition Structure Generation
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
ATAL
2010
Springer
13 years 8 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...