IEICE Technical Committee Submission System
Conference Schedule		 Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 5 of 5  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP, IPSJ-AL 2018-05-26
14:30		 Aichi Nagoya Institute of Technology Worst-Case Scenario for Γ-Robust Optimization
Jiabao Zhang (Nagoya Univ.), Wei Wu (Seikei Univ.), Mutsunori Yagiura (Nagoya Univ.) COMP2018-1		 Robust optimization is motivated by practical applications and deals with optimization problems in which some input para... [more] COMP2018-1
pp.17-24
IBISML 2013-03-05
13:00		 Aichi Nagoya Institute of Technology [Invited Talk] Meta-heuristics
Mutsunori Yagiura (Nagoya Univ.) IBISML2012-103		  [more] IBISML2012-103
p.77
COMP 2006-10-17
14:50		 Miyagi Tohoku University A Randomness Based Analysis on the Data Size Needed for Generating Reliable Rules
Kazuya Haraguchi (Kyoto Univ.), Mutsunori Yagiura (Nagoya Univ.), Endre Boros (Rutgers Univ.), Toshihide Ibaraki (Kwansei Gakuin Univ.) 		We consider a two-labeled data set $X=X_1\cup X_0$ in which each xample is a Boolean vector. A pattern is a co-occurrenc... [more] COMP2006-38
pp.57-64
COMP 2005-04-18
10:35		 Hyogo Kwansei Gakuin Univ. Exact Algorithms for the Two-Dimensional Strip Packing Problem with Rotations
Mitsutoshi Kenmochi, Takashi Imamichi, Koji Nonobe, Mutsunori Yagiura, Hiroshi Nagamochi (Kyoto Univ.) 		We examine various strategies for exact approaches to the 2-dimensional strip packing problem (2SP) with and without rot... [more] COMP2005-2
pp.5-14
COMP 2005-04-18
11:10		 Hyogo Kwansei Gakuin Univ. Branch-and-Bound Algorithms for MAX-2-SAT
Yuichi Koga, Koji Nonobe, Mutsunori Yagiura, Hiroshi Nagamochi (Kyoto Univ.), Toshihide Ibaraki (Kwansei Gakuin Univ.) 		MAX-2-SAT is one of the representative combinatorial problems and it is known to be NP-hard. It is stated as follows: Gi... [more] COMP2005-3
pp.15-24
 Results 1 - 5 of 5  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan