5314 search results - page 833 / 1063 » Hybrid Dynamic Programming |
144
click to vote
BIRTHDAY
2010
Springer
15 years 6 months ago
2010
Springer
Programmable networks offer the ability to customize router behaviour at run time, thus providing new levels of flexibility for network administrators. We have developed a program...
187
click to vote
ANOR
2008
15 years 6 months ago
2008
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
127
click to vote
CORR
2008
Springer
15 years 6 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...
185
click to vote
DISOPT
2008
15 years 6 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...
160
click to vote
DM
2008
15 years 6 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 ...