Sciweavers

52 search results - page 7 / 11
» Convergence of Independent Adaptive Learners
Sort
View
IPM
2000
142views more  IPM 2000»
13 years 7 months ago
Adapting a diagnostic problem-solving model to information retrieval
In this paper, a competition-based connectionist model for diagnostic problem-solving is adapted to information retrieval. In this model, we treat documents as \disorders" an...
Inien Syu, Sheau-Dong Lang
IJON
2006
96views more  IJON 2006»
13 years 7 months ago
Quasi-optimal EASI algorithm based on the Score Function Difference (SFD)
Equivariant Adaptive Separation via Independence (EASI) is one of the most successful algorithms for Blind Source Separation (BSS). However, the user has to choose nonlinearities,...
Samareh Samadi, Massoud Babaie-Zadeh, Christian Ju...
FLAIRS
2008
13 years 9 months ago
Extending Nearest Neighbor Classification with Spheres of Confidence
The standard kNN algorithm suffers from two major drawbacks: sensitivity to the parameter value k, i.e., the number of neighbors, and the use of k as a global constant that is ind...
Ulf Johansson, Henrik Boström, Rikard Kö...
AUTOMATICA
2007
124views more  AUTOMATICA 2007»
13 years 7 months ago
Motion planning in uncertain environments with vision-like sensors
In this work we present a methodology for intelligent path planning in an uncertain environment using vision like sensors, i.e., sensors that allow the sensing of the environment ...
Suman Chakravorty, John L. Junkins
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
14 years 1 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking