Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
VLD |
2012-03-07 14:35 |
Oita |
B-con Plaza |
Performance of the Evaluation of a Variable-Latency-Circuit on FPGA Yuuta Ukon, Kenta Ando, Atsushi Takahashi (Osaka Univ) VLD2011-141 |
The performance of integrated circuits, which are the base of ICT nowaday,
is always requested to be improved.
In de f... [more] |
VLD2011-141 pp.127-132 |
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 |
ICM |
2010-07-09 11:20 |
Hokkaido |
Future University Hakodate |
Proposal of an Unified Changing Method using Constraint Approaches in Continuity Check Configurations Hajime Nakajima, Takeshi Masuda, Yukio Akiyama (NTT Corp.) ICM2010-21 |
ETH-CC (Ethernet Continuity Check), which is standardized as one of functions in Ethernet OAM, have attracted attention ... [more] |
ICM2010-21 pp.73-78 |
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 |
SS |
2007-12-17 16:30 |
Shimane |
Shimane Univ. |
Improving Test Methods for Constraints on Network Route Structures in Constraint Programs Hajime Nakajima, Haruo Oishi, Takeshi Masuda, Tetsuya Yamamura (NTT) SS2007-49 |
In this paper, we propose a new test method for constraint programs designed to find routes in a network. These programs... [more] |
SS2007-49 pp.67-72 |
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 |