13376 search results - page 517 / 2676 » Problem Solving with |
149
click to vote
ENDM
2010
15 years 4 months ago
2010
This paper addresses the jobshop and the flowshop scheduling problems with minimum and maximum time lags. To solve this kind of problems, we propose adaptations of Climbing Discre...
195
click to vote
ICCV
2009
IEEE
17 years 2 days ago
2009
IEEE
This paper proposes a new affine registration algorithm
for matching two point sets in IR2 or IR3. The input point
sets are represented as probability density functions, using
e...
189
Voted
EOR
2008
15 years 7 months ago
2008
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
185
click to vote
INFFUS
2000
15 years 7 months ago
2000
The contribution of this paper is to compare paradigms coming from the classes of parametric, and non-parametric techniques to solve the decision fusion problem encountered in the...
157
Voted
ANSS
1998
IEEE
15 years 11 months ago
1998
IEEE
In solving application problems, the data sets used to train a neural network may not be hundred percent precise but within certain ranges. Representing data sets with intervals, ...