图 书 馆
最小种子集问题The Minimal Seed Set Problem |
|
| 课程网址: | http://videolectures.net/icaps2011_gefen_seed/ |
| 主讲教师: | Avitan Gefen |
| 开课单位: | 本古里安大学 |
| 开课时间: | 2010-06-16 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | This paper defines and studies a new, interesting, and challenging benchmark problem that originates in systems biology. The minimal seed-set problem is defined as follows: given a description of the metabolic reactions of an organism, characterize the minimal set of nutrients with which it could synthesize all nutrients it is capable of synthesizing. Current methods used in systems biology yield only approximate solutions. And although it is natural to cast it as a planning problem, current optimal planners are unable to solve it, while non-optimal planners return plans that are very far from optimal. As a planning problem, it is inherently delete-free, has many zero-cost actions, all propositions are landmarks, and many legal permutations of the plan exist. We show how a simple uninformed search algorithm that exploits inherent independence between sub-goals can solve it optimally by reducing the branching factor drastically. |
| 关 键 词: | 计算机科学; 人工智能; 规划与调度 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-11-17：cwx |
| 阅读次数: | 32 |