Sciweavers

1135 search results - page 102 / 227
» Interactive Problem Solving via Algorithm Visualization
Sort
View
110
Voted
EKAW
2004
Springer
15 years 8 months ago
A Hybrid Algorithm for Alignment of Concept Hierarchies
Hierarchical categorization is a powerful and convenient method so that it is commonly used in various areas, such as ontologies. Although each hierarchy is useful, there are probl...
Ryutaro Ichise, Masahiro Hamasaki, Hideaki Takeda
172
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski
152
Voted
AAAI
1994
15 years 4 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
114
Voted
GECCO
2006
Springer
185views Optimization» more  GECCO 2006»
15 years 6 months ago
Robot gaits evolved by combining genetic algorithms and binary hill climbing
In this paper an evolutionary algorithm is used for evolving gaits in a walking biped robot controller. The focus is fast learning in a real-time environment. An incremental appro...
Lena Mariann Garder, Mats Erling Høvin
191
Voted
MMSP
2008
IEEE
245views Multimedia» more  MMSP 2008»
15 years 9 months ago
A convex programming approach for color stereo matching
—This paper addresses the problem of dense disparity estimation from a pair of color stereo images. Based on a convex set theoretic formulation, the stereo matching problem is ca...
Wided Miled, Béatrice Pesquet-Popescu, Jean...