Sciweavers

5624 search results - page 201 / 1125
» On Conditional Covering Problem
Sort
View
ICRA
1999
IEEE
123views Robotics» more  ICRA 1999»
15 years 11 months ago
Planar Image Based Visual Servoing as a Navigation Problem
We describe a hybrid planar image-based servo algorithm which, for a simplified planar convex rigid body, converges to a static goal for all initial conditions within the workspac...
Noah J. Cowan, Daniel E. Koditschek
GEM
2008
15 years 8 months ago
Evaluating a Parallel Evolutionary Algorithm on the Chess Endgame Problem
Classifying the endgame positions in Chess can be challenging for humans and is known to be a difficult task in machine learning. An evolutionary algorithm would seem to be the ide...
Wayne Iba, Kelsey Marshman, Benjamin Fisk
UAI
1994
15 years 7 months ago
Approximation Algorithms for the Loop Cutset Problem
We show how to nd a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the rst step in the method of conditioning for inference....
Ann Becker, Dan Geiger
BC
2006
105views more  BC 2006»
15 years 6 months ago
A stochastic population approach to the problem of stable recruitment hierarchies in spiking neural networks
Recruitment learning in hierarchies is an inherently unstable process (Valiant, 1994). This paper presents conditions on parameters for a feedforward network to ensure stable recru...
Cengiz Günay, Anthony S. Maida
TNN
1998
112views more  TNN 1998»
15 years 6 months ago
A class of competitive learning models which avoids neuron underutilization problem
— In this paper, we study a qualitative property of a class of competitive learning (CL) models, which is called the multiplicatively biased competitive learning (MBCL) model, na...
Clifford Sze-Tsan Choy, Wan-Chi Siu