4843 search results - page 464 / 969 » The Shortcut Problem - Complexity and Approximation |
123
click to vote
NIPS
2008
15 years 6 months ago
2008
We study the profit-maximization problem of a monopolistic market-maker who sets two-sided prices in an asset market. The sequential decision problem is hard to solve because the ...
133
click to vote
PTS
2008
15 years 6 months ago
2008
Verification of a modular system composed of communicating components is a difficult problem, especially when the models of the components are not available. Conventional testing t...
157
click to vote
AAAI
1997
15 years 6 months ago
1997
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independentheuristics (e.g., variable ...
139
click to vote
BMCBI
2008
15 years 5 months ago
2008
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Ma...
143
Voted
DISOPT
2008
15 years 5 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...