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->

Technical Committee on Theoretical Foundations of Computing (COMP)  (Searched in: 2007)

Search Results: Keywords 'from:2007-10-16 to:2007-10-16'
[Go to Official COMP Homepage (Japanese)] 
Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Ascending)
 Results 1 - 7 of 7  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2007-10-16
10:40		 Miyagi Tohoku Univ. NP-Completeness of the Stable Roommates Problem with Triple Rooms
Kazuya Okamoto, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.) COMP2007-41		  [more] COMP2007-41
pp.1-6
COMP 2007-10-16
11:15		 Miyagi Tohoku Univ. Complexity of Finding Most Likely Solutions
Osamu Watanabe (Tokyo Inst. of Tech.) COMP2007-42		 We introduce Most Likely Solution problem,
a task of finding a most likely solution (MLS in short)
for a given problem... [more]		 COMP2007-42
pp.7-12
COMP 2007-10-16
13:30		 Miyagi Tohoku Univ. An exact algorithm for #25SAT based on dynamic proframming on path decomposition
Mitsuo Motoki (JAIST) COMP2007-43		 In 2006, Fomin et al. proposed fast exponential-time exact algorithm for some graph problems.
They combined branch-and-... [more]		 COMP2007-43
pp.13-17
COMP 2007-10-16
14:05		 Miyagi Tohoku Univ. Connectedness of domino tilings with impurities
Hirotaka Ono (Kyushu Univ.), Taizo Sadahiro (Pref. Univ. of Kumamoto) COMP2007-44		  [more] COMP2007-44
pp.19-24
COMP 2007-10-16
14:40		 Miyagi Tohoku Univ. A winning strategy for Snaky with one handicap
Hiro Ito, Hiromitsu Miyagawa (Kyoto Univ.) COMP2007-45		  [more] COMP2007-45
pp.25-32
COMP 2007-10-16
15:30		 Miyagi Tohoku Univ. An O(2^0.24945n)-time and Polynomial-space Algorithm
Hiroaki Nakanishi, Etsuji Tomita (Univ. of Electro-Comun.) COMP2007-46		 The maximum clique problem is an NP-hard problem, and is difficult
to solve efficiently. The trivial upper bound of its... [more]		 COMP2007-46
pp.33-40
COMP 2007-10-16
16:05		 Miyagi Tohoku Univ. A polynomial-time algorithm for checking the equivalence of real-time strict deterministic restricted one-counter transducers
Kazushi Seino (UEC/TSOL), Etsuji Tomita, Mitsuo Wakatsuki (UEC) COMP2007-47		  [more] COMP2007-47
pp.41-48
 Results 1 - 7 of 7  /   
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