1080 search results - page 55 / 216 » Problem dependent optimization (PDO) |
122
click to vote
IFIP
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
110
click to vote
ICPR
2000
IEEE
16 years 5 months ago
2000
IEEE
Most page segmentation algorithms have userspecifiable free parameters. However, algorithm designers typically do not provide a quantitative/rigorous method for choosing values fo...
185
click to vote
CEC
2008
IEEE
15 years 10 months ago
2008
IEEE
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...
132
click to vote
SC
1995
ACM
15 years 7 months ago
1995
ACM
We evaluate the impact of a gigabit network on the implementation of a distributed chemical process optimization application. The optimization problem is formulated as a stochasti...
149
click to vote
SIGMOD
2009
ACM
15 years 11 months ago
2009
ACM
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...