Bounded Dynamic Programming

Back to List
method ID: boundeddynamicprogramming

Entity Details

Basic Information

Entity ID

boundeddynamicprogramming

Entity Type

Method

English Label

Bounded Dynamic Programming

Russian Label

Ограниченное динамическое программирование

Kazakh Label

Шектелген динамикалық бағдарламалау

Frequency

1

Description

English Description

A programming method used to solve the Knapsack problem for optimal sentence compression.

Russian Description

-

Kazakh Description

-