Some Classes of Boolean Formulae with Polynomial Time Satisfiability Testing (あいまいさと不確実性を含む状況の数理的意思決定 研究集会報告集)

スポンサーリンク

概要

• 論文の詳細を見る
• 京都大学の論文
• 2002-02-00

著者

• Cepek Ondrej

  Department Of Theoretical Informatics And Mathematical Logic Charles University

関連論文

• WEAK AND STRONG MACHINE DOMINANCE IN A NONPREEMPTIVE FLOWSHOP
• Minimizing total completion time in a two-machine no-idle flowshop
• Nonpreemtive flowshops with a dominant machine : reductions to single mac
• A Quadratic Time Algorithm to Maximize the Number of Just-in-Time Jobs on Identical Parallel Machines
• JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS
• Just-in-Time Scheduling with Periodic Time Slots
• Some Classes of Boolean Formulae with Polynomial Time Satisfiability Testing (あいまいさと不確実性を含む状況の数理的意思決定 研究集会報告集)

スポンサーリンク