Search Results 1-6 of 6

  • A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH

    Takazawa Yotaro , Mizuno Shinji

    … We extend their algorithm to the minimum knapsack problem with a forcing graph (MKPFG), which has a forcing constraint for each edge in the graph. … The forcing constraint means that at least one item (vertex) of the edge must be packed in the knapsack. …

    Journal of the Operations Research Society of Japan 60(1), 15-23, 2017

    J-STAGE 

  • Deforming two-dimensional graphs in <i>R</i><sup>4</sup> by forced mean curvature flow

    Mao Jing

    … is a graph in <i>R</i><sup>4</sup> … evolving along a mean curvature flow with a forcing term in direction of the position vector. … ${1 \over \sqrt {2}}$ holds on the initial graph Σ<sub>0</sub> …

    Kodai Mathematical Journal 35(3), 523-531, 2012

    J-STAGE 

  • Sequential Pattern Recognition by Local Classifiers and Dynamic Time Warping  [in Japanese]

    FUKUTOMI Masahiro , OGAWARA Koichi , FENG Yaokai , UCHIDA Seiichi

    本稿では,時間的非線形伸縮を伴う時系列パターンの認識手法を提案する.本手法では,入力パターンの各サンプル点(各時刻)にクラスラベルを割り当てる.同時に,時間的非線形伸縮に対応するため,各サンプル点に標準パターン上において対応するサンプル点を割り当てる.入力パターンのクラスは,最終的に,クラスラベル数の多数決により確定される.割り当てに際し,入力パターンの時間的に隣接するサンプル点同士に相互制約を設 …

    IEICE technical report 110(187), 157-164, 2010-08-29

    References (15)

  • Sequential Pattern Recognition by Local Classifiers and Dynamic Time Warping  [in Japanese]

    FUKUTOMI Masahiro , OGAWARA Koichi , FENG Yaokai , UCHIDA Seiichi

    本稿では,時間的非線形伸縮を伴う時系列パターンの認識手法を提案する.本手法では,入力パターンの各サンプル点(各時刻)にクラスラべルを割り当てる.同時に,時間的非線形伸縮に対応するため,各サンプル点に標準パターン上において対応するサンプル点を割り当てる.入力パターンのクラスは,最終的に,クラスラべル数の多数決により確定される.割り当てに際し,入力パターンの時間的に隣接するサンプル点同士に相互制約を設 …

    IEICE technical report 110(188), 157-164, 2010-08-29

    References (15)

  • Automatic Diagnostic Rule Generation for Rule-Based Controllers by Qualitative Sensitivity Analysis

    Far Behrouz Homayoun , Nakamichi Matsuroh , Sampei Mitsuji

    … The result of MCO are complete subsets of propositions and Ordinal Reachability Graph (ORG). … Perturbation is modeled by forcing a landmark to shift to its neighboring landmark. … Sensitivity is identified as a consequence of perturbation, forcing two or more of the landmarks of a variable having the same rank. …

    IEEJ Transactions on Electronics, Information and Systems 110(10), 661-669, 1990

    J-STAGE 

  • Weighted Transaction Precedence Graph

    大森 匡 , 田中 英彦

    … We proposed a Weighted Transaction Precedence Graph (WTPG) and a cautious scheduler using it [Ohm88]. … By en-forcing the serializable order (SR-order) to make the shortest critical path in the graph, a schedule of less data/resource contention is generated. …

    全国大会講演論文集 第38回(ソフトウェア), 985-986, 1989-03-15

    IPSJ 

Page Top