Complexity of fragmentable object bin packing and an application
β Scribed by C.A. Mandal; P.P. Chakrabarti; S. Ghose
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 456 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
For programming by demonstration and for reinforcement learning, the learned skills need appropriate representations for generalization and possibilities for further improvements by the robot itself. We present a self-valuing learning technique which is capable of learning how to grasp unfamiliar ob
Let G be an undirected graph with n vertices and m edges. A natural number A is said to be a magic labeling, positive magic /abe/ing, and fractional positive magic /abe/ing, if the edges can be labeled with nonnegative intqers, naturals, and rationals 2 1 , respectively, so that for each vertex the