| slovo | definícia |
knapsack
(encz) | knapsack,batoh n: Zdeněk Brož |
Knapsack
(gcide) | Knapsack \Knap"sack`\, n. [D. knapzak; knappen to eat + zak a
bag. See Knap, v. t., and Sack.]
A case of canvas, leather, nylon, or other sturdy fabric,
fitted with straps, for carrying on the back the food,
clothing, or other supplies for a soldier or a traveler; as,
to hike up the mountain with lunch in a knapsack.
[1913 Webster +PJC]
And each one fills his knapsack or his scrip
With some rare thing that on the field is found.
--Drayton.
[1913 Webster] |
knapsack
(wn) | knapsack
n 1: a bag carried by a strap on your back or shoulder [syn:
backpack, back pack, knapsack, packsack,
rucksack, haversack] |
| | podobné slovo | definícia |
knapsacks
(encz) | knapsacks,batohy n: pl. Zdeněk Brož |
Knapsack
(gcide) | Knapsack \Knap"sack`\, n. [D. knapzak; knappen to eat + zak a
bag. See Knap, v. t., and Sack.]
A case of canvas, leather, nylon, or other sturdy fabric,
fitted with straps, for carrying on the back the food,
clothing, or other supplies for a soldier or a traveler; as,
to hike up the mountain with lunch in a knapsack.
[1913 Webster +PJC]
And each one fills his knapsack or his scrip
With some rare thing that on the field is found.
--Drayton.
[1913 Webster] |
0/1 knapsack problem
(foldoc) | 0/1 knapsack problem
The knapsack problem restricted so that the
number of each item is zero or one.
(1995-03-13)
|
knapsack problem
(foldoc) | knapsack problem
Given a set of items, each with a
cost and a value, determine the number of each item to include
in a collection so that the total cost is less than some given
cost and the total value is as large as possible.
The 0/1 knapsack problem restricts the number of each items to
zero or one.
Such constraint satisfaction problems are often solved using
dynamic programming.
The general knapsack problem is NP-hard, and this has led to
attempts to use it as the basis for public-key encryption
systems. Several such attempts failed because the knapsack
problems they produced were in fact solvable by
polynomial-time algorithms.
[Are there any trusted knapsack-based public-key
cryptosystems?].
(1995-04-10)
|
|