5864 search results - page 239 / 1173 » Can We Work around Numerical Methods |
151
click to vote
GECCO
2007
Springer
16 years 8 days ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
128
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
Optimizing combinations of placements of parts, known as markers, is an important preparatory step in order-based industrial production of clothes. Given a work order in the form ...
126
click to vote
ICASSP
2008
IEEE
16 years 17 days ago
2008
IEEE
We consider probabilistic methods to compute the near midair collision risk using state estimate and covariance from a target tracking filter based on angle-only sensors such as ...
158
click to vote
VISSYM
2003
15 years 7 months ago
2003
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...
157
click to vote
EOR
2006
15 years 6 months ago
2006
In this paper, we present a stochastic model for the dynamic fleet management problem with random travel times. Our approach decomposes the problem into time-staged subproblems by...