Sciweavers

14386 search results - page 279 / 2878
» The Chinese Generals Problem
Sort
View
WSC
2004
15 years 6 months ago
Retrospective Approximation Algorithms for the Multidimensional Stochastic Root-Finding Problem
The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper...
Raghu Pasupathy, Bruce W. Schmeiser
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
15 years 6 months ago
Solving constrained multi-objective problems by objective space analysis
In this paper a new approach to solve constrained multi-objective problems by way of evolutionary multi-objective optimization is introduced. In contrast to former evolutionary ap...
Gideon Avigad, Carlos A. Coello Coello
ADCM
2008
111views more  ADCM 2008»
15 years 5 months ago
Sigma-delta quantization errors and the traveling salesman problem
In transmission, storaging and coding of digital signals we frequently perform A/D conversion using quantization. In this paper we study the maxiaml and mean square errors as a res...
Yang Wang
IJIG
2008
222views more  IJIG 2008»
15 years 4 months ago
An Analytical Solution to the Perspective-n-Point Problem for Common Planar Camera and for Catadioptric Sensor
The Perspective-N-Point problem (PNP) is a notable problem in computer vision. It consists in, given N points known in an object coordinate space and their projection onto the ima...
Jonathan Fabrizio, Jean Devars
JGO
2008
98views more  JGO 2008»
15 years 4 months ago
Duality for almost convex optimization problems via the perturbation approach
Abstract. We deal with duality for almost convex finite dimensional optimization problems by means of the classical perturbation approach. To this aim some standard results from th...
Radu Ioan Bot, Gábor Kassay, Gert Wanka