Sciweavers

1157 search results - page 134 / 232
» Solving iterated functions using genetic programming
Sort
View
120
Voted
CP
2006
Springer
15 years 7 months ago
Global Optimization of Probabilistically Constrained Linear Programs
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
Shabbir Ahmed
176
Voted
NCA
2008
IEEE
15 years 3 months ago
Neurodynamic programming: a case study of the traveling salesman problem
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
Jia Ma, Tao Yang, Zeng-Guang Hou, Min Tan, Derong ...
199
Voted
MMSP
2008
IEEE
245views Multimedia» more  MMSP 2008»
15 years 10 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...
133
Voted
SEAL
1998
Springer
15 years 8 months ago
Evolutionary Programming-Based Uni-vector Field Method for Fast Mobile Robot Navigation
Most of the obstacle avoidance techniques do not consider the robot orientation or its nal angle at the target position. These techniques deal with the robot position only and are ...
Yong-Jae Kim, Dong-Han Kim, Jong-Hwan Kim
156
Voted
ICTAI
2010
IEEE
15 years 1 months ago
Continuous Search in Constraint Programming
This work presents the concept of Continuous Search (CS), which objective is to allow any user to eventually get their constraint solver achieving a top performance on their proble...
Alejandro Arbelaez, Youssef Hamadi, Michèle...