๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A resource-bounded agent addresses the newcomb problem

โœ Scribed by John L. Pollock

Publisher
Springer Netherlands
Year
2009
Tongue
English
Weight
218 KB
Volume
176
Category
Article
ISSN
0039-7857

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A branch and bound algorithm for the res
A branch and bound algorithm for the resource-constrained project scheduling problem
โœ Peter Brucker; Sigrid Knust; Arno Schoo; Olaf Thiele ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 257 KB

A branch and bound algorithm is presented for the resource-constrained project scheduling problem (RCPSP). Given are n activities which have to be processed without preemptions. During the processing period of an activity constant amounts of renewable resources are needed where the available capacit