16843 search results - page 345 / 3369 » On Generalized Authorization Problems |
154
click to vote
COR
2007
15 years 6 months ago
2007
The paper discusses the deļ¬nition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
174
click to vote
EOR
2007
15 years 6 months ago
2007
The knapsack problem (KP) is generalized to the case where items are partially ordered through a set of precedence relations. As in ordinary KPs, each item is associated with proļ...
188
click to vote
IANDC
2007
15 years 6 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...
185
click to vote
MOR
2007
15 years 6 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 proļ¬ts of each of the edges is maximized. The set M is...
163
click to vote
CDC
2009
IEEE
15 years 4 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...