Search Results 1-20 of 452

  • Energy Minimization over <i>m</i>-Branched Enumeration for Generalized Linear Subspace Clustering

    ZHANG Chao

    … To settle this problem, we take advantages of both greedy strategy and energy minimization strategy to propose a simple yet effective algorithm based on the assumption that an <i>m</i>-branched (i.e., perfect <i>m</i>-ary) tree which is constructed by collecting <i>m</i>-nearest neighbor points in each node has a high probability of containing the near-exact subspace. …

    IEICE Transactions on Information and Systems E102.D(12), 2485-2492, 2019


  • Modeling and tracking spatiotemporal objects by mixture distribution:Application to phased-array weather radar data  [in Japanese]

    HAYASHI Ryo , FUJI Yuki , HONDA Rie , SATO Shinsuke , MURATA Takefumi , MURANAGA Kazuya , UKAWA Kentaro , SASA Koji , MURATA Fumie


    Proceedings of the Annual Conference of JSAI JSAI2019(0), 4P2J304-4P2J304, 2019


  • Toward Deep Satisficing Reinforcement Learning  [in Japanese]

    SATORI Kuniaki , YOSHIDA Yutaka , KAMIYA Takumi , TAKAHASHI Tatsuji

    … <p>強化学習では連続状態空間を扱う方法としてDQNなどが提案されているが,DQNはε‒greedyのようなランダム探索戦略に依存しているため,膨大な探索空間を扱う場合に適切な探索と活用を行うことは非常に困難である.一方で人間は満足化という意思決定傾向によりこれを解決しているとされる.その満足化を強化学習に反映したアルゴリズムとして Risk‒sensitive Satisficing (RS) が考案された.RSを深層強化学習に適用 …

    Proceedings of the Annual Conference of JSAI JSAI2019(0), 2P1J201-2P1J201, 2019


  • Greedy Action Selection and Pessimistic Q-Value Updating in Multi-Agent Reinforcement Learning with Sparse Interaction

    KUJIRAI Toshihiro , YOKOTA Takayoshi

    … We have now modified the learning algorithm used in a combination of these two methods to enable it to cope with interference among more than two agents. … Evaluation of this enhanced method using two additional maze games from three perspectives (the number of steps to a goal, the number of augmented states, and the computational cost) demonstrated that the modified algorithm improves the performance of CQ-learning.</p> …

    SICE Journal of Control, Measurement, and System Integration 12(3), 76-84, 2019


  • A Mixed Denoising Algorithm Based on Weighted Joint Sparse Representation

    Hu Yu Ping

    … The greedy algorithm based on weighted simultaneous orthogonal matching pursuit is used to approximate the global optimal solution of the model effectively. …

    Journal of Advanced Computational Intelligence and Intelligent Informatics 23(2), 313-316, 2019


  • Greedy-Based VNF Placement Algorithm for Dynamic Multipath Service Chaining

    TABOTA Kohei , TACHIBANA Takuji

    … In this paper, for dynamic multipath service chaining, we propose a greedy-based VNF placement algorithm. … The proposed algorithm consists of four difference algorithms, and VNFs are placed appropriately with those algorithm. …

    IEICE Transactions on Communications E102.B(3), 429-438, 2019


  • A Topology Optimization Method for Electric Machines and Devices through Submodular Maximization  [in Japanese]

    Sato Takahiro , Fujita Masafumi

    … <p>This paper presents a topology optimization method using a greedy algorithm for submodular maximization. … In addition, it can be found from the numerical results that the stochastic greedy algorithm can effectively reduce the computational time compared with the conventional greedy algorithm. …

    IEEJ Transactions on Fundamentals and Materials 139(3), 181-187, 2019


  • Green Data Gathering from Geo-distributed IoT Networks via LEO Satellites

    Huang Huawei , Guo Song , Liang Weifa , Wang Kun

    … To address this problem, we first formulate a novel optimization problem, and then propose an online algorithm for green data-uploading in geo-distributed IoT networks. … We finally evaluate the performance of the proposed algorithm through simulations using both real-world and synthetic traces. … The simulation results demonstrate that the proposed approach can achieve high efficiency on the power consumption and significantly reduce queue backlogs compared with a benchmark using greedy policy. …

    2018 IEEE International Conference on Communications (ICC), 2018-05


  • Gradually Stacking Neural Network  [in Japanese]

    佐々木 駿也 , 萩原 将文

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 117(508), 175-180, 2018-03-13

  • Local Feature Reliability Measure Consistent with Match Conditions for Mobile Visual Search

    MATSUZAKI Kohei , TASAKA Kazuyuki , YANAGIHARA Hiromasa

    … As this problem is NP-hard and thus computationally infeasible, we explore approximate solutions based on a greedy algorithm. …

    IEICE Transactions on Information and Systems E101.D(12), 3170-3180, 2018


  • Optimal Laser Scan Planning of Terrestrial Laser Scanner for As-built Modeling of HVAC Systems  [in Japanese]

    WAKISAKA Eisuke , KANAI Satoshi , DATE Hiroaki

    … We propose an algorithm for a model-based optimum scan planning method for a TLS. … In an evaluation, the proposed algorithm outperformed our previously proposed greedy method in terms of the number of scans and scan coverage ratio, and it shows performance equal to the greedy method in terms of modeling quality.</p> …

    Journal of the Japan Society for Precision Engineering 84(8), 738-745, 2018


  • Examination of object tracking method for space-temporal data based on greedy EM algorithm  [in Japanese]


    … <p>Greedy EMアルゴリズムの考えをオブジェクトの時間追跡に応用することによって,発生、消滅しながら時間変化するオブジェクトの混合モデルによる追跡の精度を高める手法を考案した。 …

    Proceedings of the Annual Conference of JSAI JSAI2018(0), 3L204-3L204, 2018


  • A GRASP with efficient neighborhood search for the integrated maintenance and bus scheduling problem

    FUKUSHIGUE HAMA Vitor Mitsuo , WU Wei , YAGIURA Mutsunori

    … We propose a heuristic algorithm using the framework of greedy randomized adaptive search procedure (GRASP), and we improve the neighborhood search procedure by using an ordered list of possible trips. … Through computational experiments on instances generated from real-world data, we show that the proposed algorithm finds solutions that are as good as or better than those obtained by a commercial solver in less than 5% of the time required by the latter.</p> …

    Journal of Advanced Mechanical Design, Systems, and Manufacturing 12(3), JAMDSM0072-JAMDSM0072, 2018


  • Iterative improvement approaches for collecting weighted items in directed bipartite graphs

    KARUNO Yoshiyuki , TANAKA Seiya

    … Recently, a greedy heuristic algorithm has been presented for the weighted item collecting problem. … The greedy heuristic algorithm obtains an optimal solution of a known test instance of the original integrated circuit design problem in a short execution time, while for a randomly generated instance, there may be some room for improvement of the heuristic quality. …

    Journal of Advanced Mechanical Design, Systems, and Manufacturing 12(2), JAMDSM0051-JAMDSM0051, 2018


  • Optimal Input Elimination

    SATO Kazuhiro

    … It is shown that a greedy algorithm gives the global optimal solution to the finite combinatorial problem within a practical time. … The algorithm can be understood that we eliminate input variables in ascending order of the average controllability centralities which assign relative importances to each node within a network. …

    SICE Journal of Control, Measurement, and System Integration 11(2), 100-104, 2018


  • Low Complexity Compressive Sensing Greedy Detection of Generalized Quadrature Spatial Modulation

    RAMANATHAN Rajesh , MALLICK Partha Sharathi , SUNDARAJAN JAYARAMAN Thiruvengadam

    … <p>In this letter, we propose a generalized quadrature spatial modulation technique (GQSM) which offers additional bits per channel use (bpcu) gains and a low complexity greedy detector algorithm, structured orthogonal matching pursuit (S-OMP)- GQSM, based on compressive sensing (CS) framework. … Simulation results show that the bit error rate (BER) performance of the proposed greedy detector is very close to maximum likelihood (ML) and near optimal detectors based on convex programming.</p> …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E101.A(3), 632-635, 2018


  • Module partition for mechanical CAD assembly model based on multi-source correlation information and community detection

    HAN Zhoupeng , MO Rong , YANG Haicheng , HAO Li

    … After that, a community detection algorithm upon greedy thought is given to discover communities in weighted network, thereby realizing the modularization of mechanical CAD assembly model. …

    Journal of Advanced Mechanical Design, Systems, and Manufacturing 12(1), JAMDSM0023-JAMDSM0023, 2018


  • An effectiveness-oriented greedy heuristic for padding short paths in ultra-low supply voltage designs

    He Yan , Meng Jianyi , Chen Zhijian , Xiang Xiaoyan , Chen Chen

    … <p>Among prior short paths padding algorithms, greedy heuristic based on the number of short paths had been proven to be area saving and fast. … To overcome this problem, we propose a new evaluation function "effectiveness" for greedy heuristic, to characterize the benefit of buffer insertion, thereby to optimize the allocation of padding delay and reduce buffer overhead. … An improved algorithm to dynamically update slacks during delay assignment stage is also introduced. …

    IEICE Electronics Express 15(3), 20171229-20171229, 2018


  • Comparing greedy-type algorithms for RSA problems of anycasting in elastic networks  [in Japanese]

    宮川 穏貴 , 渡部 洋介 , 繁野 麻衣子 , 石井 紀代 , 竹房 あつ子 , 吉瀬 章子

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 117(298), 1-8, 2017-11-15

  • Transmission Scheduling for Eavesdropping Avoidance by Intentional Collisions in Wireless Sensor Networks  [in Japanese]

    大栗 正宏 , 桧垣 博章

    電気学会研究会資料. SMF = The papers of Technical Meeting on Smart Facilities, IEE Japan 2017(14-25), 21-26, 2017-06-15

Page Top