2126 search results - page 208 / 426 » An optimization algorithm for imprecise multi-objective prob... |
190
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
185
click to vote
PVLDB
2010
15 years 5 months ago
2010
A Business Process (BP for short) consists of a set of activities that achieve some business goal when combined in a flow. Among all the (maybe infinitely many) possible executi...
172
click to vote
GECCO
2005
Springer
16 years 4 days ago
2005
Springer
The prediction of the native structures of proteins, the socalled protein folding problem, is a NP hard multi-minima optimization problem for which to date no routine solutions ex...
200
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Multiple sequence alignment (MSA) is a useful tool in bioinformatics. Although many MSA algorithms have been developed, there is still room for improvement in accuracy...
189
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this report, we consider the problem of real-time transmission scheduling over time-varying channels. We first formulate the transmission scheduling problem as a Markov decisio...