5757 search results - page 924 / 1152 » Dynamic Policy Programming |
DISOPT
2008
13 years 11 months ago
2008
We study a pricing problem where buyers with non-uniform demand purchase one of many items. Each buyer has a known benefit for each item and purchases the item that gives the larg...
DM
2008
13 years 11 months ago
2008
The reinforcement number of a graph is the smallest number of edges that have to be added to a graph to reduce the domination number. We introduce the k-reinforcement number of a ...
EOR
2008
13 years 10 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
CL
2006
Springer
13 years 10 months ago
2006
Springer
Many software systems suffer from missing support for behavioral (runtime) composition and configuration of software components. The concern "behavioral composition and confi...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
A pants decomposition of an orientable surface is a collection of simple cycles that partition into pants, i.e., surfaces of genus zero with three boundary cycles. Given a set P...