Sciweavers

5624 search results - page 200 / 1125
» On Conditional Covering Problem
Sort
View
TNN
2010
182views Management» more  TNN 2010»
15 years 1 months ago
A discrete-time neural network for optimization problems with hybrid constraints
Abstract--Recurrent neural networks have become a prominent tool for optimizations including linear or nonlinear variational inequalities and programming, due to its regular mathem...
Huajin Tang, Haizhou Li, Zhang Yi
ICCV
2011
IEEE
14 years 6 months ago
Optimizing Polynomial Solvers for Minimal Geometry Problems
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
Oleg Naroditsky, Kostas Daniilidis
ICML
2000
IEEE
16 years 7 months ago
Convergence Problems of General-Sum Multiagent Reinforcement Learning
Stochastic games are a generalization of MDPs to multiple agents, and can be used as a framework for investigating multiagent learning. Hu and Wellman (1998) recently proposed a m...
Michael H. Bowling
ICRA
2009
IEEE
133views Robotics» more  ICRA 2009»
16 years 1 months ago
A stochastically stable solution to the problem of robocentric mapping
Abstract— This paper provides a novel solution for robocentric mapping using an autonomous mobile robot. The robot dynamic model is the standard unicycle model and the robot is a...
Adrian N. Bishop, Patric Jensfelt
GECCO
2003
Springer
101views Optimization» more  GECCO 2003»
15 years 11 months ago
An Analysis of a Reordering Operator with Tournament Selection on a GA-Hard Problem
This paper analyzes the performance of a genetic algorithm that utilizes tournament selection, one-point crossover, and a reordering operator. A model is proposed to describe the c...
Ying-Ping Chen, David E. Goldberg