4131 search results - page 96 / 827 » The Generalized Max-Controlled Set Problem |
127
click to vote
AAAI
2007
15 years 5 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
146
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
126
click to vote
WADS
2007
Springer
15 years 9 months ago
2007
Springer
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a speciļ¬ed connectivity property, such as bridge-connectivi...
124
click to vote
EOR
2007
15 years 3 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ļ...
112
click to vote
CP
2005
Springer
15 years 8 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...