4469 search results - page 657 / 894 » Dynamic Program Slicing |
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all cod...
140
click to vote
DISOPT
2008
15 years 2 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...
106
click to vote
DM
2008
15 years 2 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 ...
116
click to vote
EOR
2008
15 years 2 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...
136
click to vote
CL
2006
Springer
15 years 2 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...