9477 search results - page 210 / 1896 » Design is as Easy as Optimization |
232
click to vote
EC
2007
15 years 6 months ago
2007
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
215
click to vote
PE
2002
Springer
15 years 6 months ago
2002
Springer
In this paper, we study the use of continuous-time hidden Markov models (CT-HMMs) for network protocol and application performance evaluation. We develop an algorithm to infer the...
196
click to vote
PPSN
2010
Springer
15 years 4 months ago
2010
Springer
We present methods to answer two basic questions that arise when benchmarking optimization algorithms. The first one is: which algorithm is the `best' one? and the second one:...
180
click to vote
IOR
2011
15 years 1 months ago
2011
We derive a knowledge gradient policy for an optimal learning problem on a graph, in which we use sequential measurements to refine Bayesian estimates of individual edge values i...
205
click to vote
TSMC
2010
15 years 1 months ago
2010
The memory dumping problem arises in the context of planning and scheduling activities of the Mars Express mission of the European Space Agency. The problem consists of scheduling...