14548 search results - page 363 / 2910 » The Optimal Path-Matching Problem |
165
click to vote
DSN
2004
IEEE
15 years 10 months ago
2004
IEEE
Abstract-We present a new form of quantitative safety analysis safety optimization. This method is a combination of fault tree analysis(FTA) and mathematical optimization technique...
164
click to vote
GECCO
2004
Springer
16 years 3 days ago
2004
Springer
Several inverse problems exist in the atmospheric sciences that are computationally costly when using traditional gradient based methods. Unfortunately, many standard evolutionary ...
184
click to vote
EVOW
2000
Springer
15 years 10 months ago
2000
Springer
Ant Colony Optimization is an evolutionary method that has recently been applied to scheduling problems. We propose an ACO algorithm for the Single Machine Total Weighted Tardiness...
173
click to vote
IRREGULAR
1995
Springer
15 years 10 months ago
1995
Springer
Sparse matrix problems are di cult to parallelize e ciently on message-passing machines, since they access data through multiple levels of indirection. Inspector executor strategie...
158
Voted
ENDM
2010
15 years 6 months ago
2010
We study an extension of the precedence constrained knapsack problem where the knapsack can be filled in multiple periods. This problem is known in the mining industry as the open...