6562 search results - page 334 / 1313 » Noetherianity and Combination Problems |
173
click to vote
EOR
2008
15 years 6 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...
169
click to vote
COR
2006
15 years 6 months ago
2006
We discuss how constraint programming can improve the performance of a column generation solution process for the NP-hard Tail Assignment problem in aircraft scheduling. Combining...
148
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We describe and analyze sparse graphical code constructions for the problems of source coding with decoder side information (the Wyner-Ziv problem), and channel coding with encoder...
174
click to vote
IJIIDS
2008
15 years 6 months ago
2008
: Global Navigation Satellite Systems (GNSS) are often used to localise a receiver with respect to a given map. This association problem, also known as map-matching, is usually add...
165
click to vote
IANDC
2006
15 years 6 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...