14548 search results - page 303 / 2910 » The Optimal Path-Matching Problem |
194
click to vote
SAGA
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. Motivated by an application in project portfolio analysis under uncertainty, we develop an algorithm S-VNS for solving stochastic combinatorial optimization (SCO) problem...
175
click to vote
KR
2004
Springer
15 years 12 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
188
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different evoluti...
176
click to vote
AMAI
2006
Springer
15 years 6 months ago
2006
Springer
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
187
click to vote
AMC
2006
15 years 6 months ago
2006
We develop a multi-objective model for the resource allocation problem in a dynamic PERT network, where the activity durations are exponentially distributed random variables and t...