4432 search results - page 102 / 887 » Solving Demodulation as an Optimization Problem |
134
Voted
ICCV
1998
IEEE
15 years 6 months ago
1998
IEEE
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum- ow problem. Once solved, the minimum-cut associated ...
106
click to vote
ISSAC
2007
Springer
15 years 8 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
115
Voted
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we present a stigmergy-based algorithm for solving optimization problems with continuous variables, labeled Differential Ant-Stigmergy Algorithm (DASA). The perfor...
119
click to vote
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we present a stigmergy-based algorithm for solving optimization problems with continuous variables, labeled Differential Ant-Stigmergy Algorithm (DASA). The perfor...
117
Voted
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
In this paper, we present an empirical comparison of some Differential Evolution variants to solve global optimization problems. The aim is to identify which one of them is more s...