14158 search results - page 69 / 2832 » Generalized switch-setting problems |
161
click to vote
CONCUR
2004
Springer
15 years 9 months ago
2004
Springer
We introduce a generic family of behavioral relations for which the problem of comparing an arbitrary transition system to some finite-state specification can be reduced to a model...
156
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
165
click to vote
MOR
2007
15 years 5 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...
147
click to vote
CDC
2009
IEEE
15 years 3 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...
197
click to vote
IWOCA
2010
Springer
15 years 25 days 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 ...