| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| NLP, MSS | 2023-03-16 16:05 |
Nagasaki | (Primary: On-site, Secondary: Online) |
Online Optimization of Pickup and Delivery Problem Considering Demand Forecasting Ryo Matsuoka, Koichi Kobayashi, Yuh Yamashita (Hokkaido Univ.)  MSS2022-91 NLP2022-136 |
In this paper, we consider an online pickup and delivery problem. Online optimization is to solve the pickup and deliver... [more] | MSS2022-91 NLP2022-136 pp.136-139 |
| CAS, MSS, IPSJ-AL [detail] | 2022-11-17 15:30 |
Kochi | (Primary: On-site, Secondary: Online) |
Online Optimization of Pickup and Delivery Problem with Fuel Constraints Ryo Matsuoka, Koichi Kobayashi, Yuh Yamashita (Hokkaido Univ.) CAS2022-43 MSS2022-26 |
In this paper, we consider an online pickup and delivery problem. Online optimization is to solve the pickup and deliver... [more] | CAS2022-43 MSS2022-26 pp.34-37 |
| ET | 2022-11-05 13:50 |
Online | Online | Design of Feedback in A Support System for Leaning of Relationship between Function and Model of Behavior of Source Code Taiki Matsui, Shintaro Maeda, Kento Koike, Takahito Tomoto (Tokyo Polytechnic Univ) ET2022-35 |
In learning programming, it is important to learn the source code of others, and it is important to consider what functi... [more] | ET2022-35 pp.29-34 |
| MSS, CAS, IPSJ-AL [detail] | 2020-11-26 16:15 |
Online | Online | ADMM and Constraint Optimization Approach to Unit Commitment of Distributed Energy Management System Yuta Inoue, Toshiyuki Miyamoto (Osaka Univ.) CAS2020-36 MSS2020-28 |
Unit commitment problem (UCP) is the problem deciding the up/down pattern and generation level of units.In recent years,... [more] | CAS2020-36 MSS2020-28 pp.96-101 |
| RCC, MICT | 2019-05-29 13:00 |
Tokyo | TOKYO BIG SIGHT | Dynamic Surveillance over Graphs by Multiple Agents
-- On Feasibility Conditions -- Koichi Kobayashi (Hokkaido Univ.) RCC2019-1 MICT2019-1 |
The surveillance problem is to find optimal trajectories of agents that patrol a given area as evenly as possible. In th... [more] | RCC2019-1 MICT2019-1 pp.1-4 |
| PRMU, BioX | 2019-03-18 16:10 |
Tokyo | [Invited Talk]
Geometrically Consistent Pedestrian Trajectory Extraction for Gait Recognition (BTAS 2018) Yasushi Makihara, Gakuto Ogi, Yasushi Yagi (Osaka Univ.) BioX2018-66 PRMU2018-170 |
In the gait recognition community, silhouette-based gait representations such as gait energy image have been widely empl... [more] | BioX2018-66 PRMU2018-170 p.207 |
|
| SS | 2019-03-04 16:45 |
Okinawa | SQL queries for generating input constraints of SMT solvers from descriptions of combinatorial optimization problems Genki Sakanashi, Masahiko Sakai, Naoki Nishida, Kenji Hashimoto (Nagoya Univ.) SS2018-66 |
The authors recently proposed an SQL-based language CombSQL+ for specifying combinatorial optimization problems, and sho... [more] | SS2018-66 pp.85-90 |
|
| KBSE | 2018-03-02 14:20 |
Okinawa | A Study on a Programming Framework for Self-Adaptive Systems
-- Dynamic Verification Considering Time Constraints -- Hiroki Tsuda, Hiroyuki Nakagawa, Tatsuhiro Tsuchiya (Osaka Univ.) KBSE2017-59 |
Self-adaptive systems can adapt to environment changes and changes of internal conditions. In embedded systems that have... [more] | KBSE2017-59 pp.121-126 |
|
| VLD | 2016-02-29 15:50 |
Okinawa | Okinawa Seinen Kaikan | ILP Based Synthesis of Soft-Error Tolerant Datapaths Considering Adjacency Constraint between Components Junghoon Oh, Mineo Kaneko (JAIST) VLD2015-116 |
As the device size decreases, the reliability degradation due to soft-errors is becoming one of the serious issues in VL... [more] | VLD2015-116 pp.31-36 |
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2014-11-26 10:45 |
Oita | B-ConPlaza | A hardware description method and sematics providing a timing constrant Shunji Nishimura, Motoki Amagasaki, Toshinori Sueyoshi (Kumamoto Univ.) VLD2014-82 DC2014-36 |
Formal verification methods are wide-spreading due to its mathmatical rigorousaspect, although they limited to synchroun... [more] | VLD2014-82 DC2014-36 pp.81-86 |
| KBSE | 2014-03-07 13:10 |
Okinawa | Okinawaken-Seinenkaikan | An Implementation Methodology for Business Systems Based on Unidirectional Constraint Propagation
-- A Case Study of Local Tax Processing -- Hiromasa Yano, Hiroki Kuwayama, Shigeo Kaneda (Doshisha Univ.) KBSE2013-94 |
ICT systems for business applications must accept not only basic business work-flows but also modification of the former... [more] | KBSE2013-94 pp.91-96 |
| OCS, PN, NS (Joint) |
2013-06-21 09:50 |
Fukushima | College of Engineering, Nihon University | High-Speed Calculation Method for Multi-layer Network Design Problem using Ring Topology Koudai Takahashi, Taiju Mikoshi, Toyofumi Takenaka (Nihon Univ.) NS2013-32 |
In recent years, multi-layer network (MLN) design methods have attracted great attentions of backbone carriers for their... [more] | NS2013-32 pp.19-24 |
| SS, MSS | 2012-01-27 09:00 |
Kochi | Kochi City Culture-Plaza Cul-Port | [Invited Talk]
Research Cases on Interval Constraint Programming
-- A Projection Method for Under-Constrained Problems and a Precise Simulation Method for Hybrid Systems -- Daisuke Ishii (NII) MSS2011-67 SS2011-52 |
Interval constraint programming is a framework for describing various phenomena with constraints that involve variables ... [more] | MSS2011-67 SS2011-52 pp.73-77 |
| IT | 2012-01-20 14:05 |
Ibaraki | University of Tsukuba | A note on novel permutation codes based on pure involution codes Kazuhiro Fuwa, Tadashi Wadayama (NIT) IT2011-39 |
In this paper, we propose a novel class of permutation codes based on pure involution codes. Pure involution code is a ... [more] |
IT2011-39 pp.1-6 |
| SS | 2011-10-28 09:30 |
Ishikawa | JAIST | Parametric Execution Time Analysis for Recursive Programs and its Experimental Evaluation Kazuhiro Kabashima, Akio Nakata (Hiroshima City Univ.) SS2011-33 |
It is generally difficult to reuse real-time software components to different execution platforms, since its execution t... [more] | SS2011-33 pp.37-42 |
| COMP | 2008-12-03 14:35 |
Gunma | Gunma Univ. | Improved Formula Size Lower Bounds for Monotone Self-Dual Boolean Functions Kenya Ueno (Univ. of Tokyo) COMP2008-51 |
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduc... [more] | COMP2008-51 pp.33-40 |
| VLD, CAS, SIP | 2008-06-27 09:20 |
Hokkaido | Hokkaido Univ. | Safe Clocking Minimum Register Assignment in High-Level Synthesis Keisuke Inoue, Mineo Kaneko, Tsuyoshi Iwagaki (JAIST) CAS2008-20 VLD2008-33 SIP2008-54 |
For recent and future nanometer-technology VLSIs, static and dynamic delay variations become a serious problem. In man... [more] |
CAS2008-20 VLD2008-33 SIP2008-54 pp.7-12 |
| VLD, CPSY, RECONF, DC, IPSJ-SLDM, IPSJ-ARC (Joint) [detail] |
2007-11-20 15:10 |
Fukuoka | Kitakyushu International Conference Center | A Method for Optimizing Communication Architecture on Network-on-Chip Considering Chip Size and Wiring Costs Daisuke Hayashi, Wataru Murai (Osaka Univ.), Akio Nakata (Hiroshima City Univ.), Tomoya Kitani, Keiichi Yasumoto (NAIST), Teruo Higashino (Osaka Univ.) CPSY2007-35 |
In this paper, we propose a method for deriving an optimal Network-on-Chip (NoC) communication architecture using intege... [more] | CPSY2007-35 pp.1-6 |
| LOIS, IN, ICM | 2005-01-20 14:40 |
Fukuoka | Fukuoka Institute of Technology | Optimization of Telecommunication Network Based on Capacity Analysis using Dynamic Programming Approach Jun Wu, Wuyi Yue (Konan Univ.) |
In this paper, we present a stochastic model for optimizing bandwidth allocation in Multimedia Communication Networks (M... [more] | IN2004-147 TM2004-70 OIS2004-68 pp.19-24 |
[Return to Top Page]