14386 search results - page 257 / 2878 » The Chinese Generals Problem |
151
Voted
IANDC
2007
15 years 4 months ago
2007
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
144
Voted
MOR
2007
15 years 4 months ago
2007
The objective of the demand matching problem is to obtain the subset M of edges which is feasible and where the sum of the profits of each of the edges is maximized. The set M is...
133
click to vote
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
This paper considers the max-min quantum error recovery problem; the recovery channel to be designed maximizes the fidelity between input and output states of a given noisy channel...
178
click to vote
IWOCA
2010
Springer
14 years 11 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
194
click to vote
CPAIOR
2011
Springer
14 years 8 months ago
2011
Springer
In this work we present the Partner Units Problem as a novel challenge for optimization methods. It captures a certain type of configuration problem that frequently occurs in indu...