14386 search results - page 301 / 2878 » The Chinese Generals Problem |
145
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
155
click to vote
AAAI
2008
15 years 7 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
140
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The stable marriage problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to...
158
click to vote
NETWORKS
2010
15 years 3 months ago
2010
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
135
Voted
SIAMSC
2010
15 years 3 months ago
2010
Abstract. We develop duality-based a posteriori error estimates for functional outputs of solutions of free-boundary problems via shape-linearization principles. To derive an appro...