| 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 # | |
| R | 2023-11-03 14:20 |
Ishikawa | The Kanazawa Chamber of Commerce and Industry (Primary: On-site, Secondary: Online) |
Optimal Maintenance Policy for a Markovian Deteriorating System under Random Operating Environment Nobuyuki Tamura (Hosei Univ.)  R2023-46 |
We consider a system whose deterioration follows a discrete-time and discrete-state Markov chain with an absorbing state... [more] | R2023-46 pp.10-15 |
| QIT (2nd) |
2020-12-11 14:30 |
Online | Online | Monotone metrics induced from trace non-increasing maps Koichi Yamagata (UEC) |
Quantum monotone metric was introduced by Petz, and it was proved that quantum monotone metrics on the set of quantum st... [more] | |
| IBISML | 2018-11-05 15:10 |
Hokkaido | Hokkaido Citizens Activites Center (Kaderu 2.7) | [Poster Presentation]
Bregman monotone operator splitting and its application example Kenta Niwa (NTT), W. Bastiaan Kleijn (VUW) IBISML2018-80 |
Monotone operator splitting is a powerful paradigm that facilitates parallel processing for optimization problems where ... [more] | IBISML2018-80 pp.271-278 |
| R | 2015-07-31 15:35 |
Aomori | Decomposition of a multi-state system by series systems Fumio Ohi (N.I.T.) R2015-19 |
It is well-known for every binary state system to be decomposed into a family of series systems or of parallel systems a... [more] | R2015-19 pp.31-35 |
|
| COMP | 2013-06-24 15:10 |
Nara | Nara Women's University | On a parametic integer programming algorithm using dualization of monotone Boolean function Norie Fu (NII), Takafumi Shibuta (Kyushu Univ.) COMP2013-23 |
The {it parametric integer programing} is the integer programming with a vector of parameters as its right-hand-side vec... [more] | COMP2013-23 pp.23-30 |
| COMP | 2006-06-23 11:10 |
Saitama | Saitama Univ. | Reductions for Monotone Boolean Circuits Kazuo Iwama, Hiroki Morizumi (Kyoto Univ.) |
The large class, say {\it NLOG}, of Boolean functions, including 0-1 Sort and 0-1 Merge, have an upper bound of $O(n\log... [more] | COMP2006-19 pp.15-19 |
| COMP | 2006-05-24 10:40 |
Fukuoka | Kyushu Institute of Technology | Minimum Augmentation of Edge-Connectivity with Monotone Requirements in Undirected Graphs Toshimasa Ishii (Otaru Univ. of Commerce) |
For a finite ground set $V$, we call a set-function $r: 2^V \rightarrow Z^+$ monotone, if $r(X')\geq r(X)$ holds for... [more] | COMP2006-10 pp.1-8 |
[Return to Top Page]