|
|
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2009)
|
|
Search Results: Keywords 'from:2009-09-14 to:2009-09-14'
|
[Go to Official COMP Homepage (Japanese)] |
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Ascending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP |
2009-09-14 10:40 |
Tottori |
Tottori University of Environmental Studies |
The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata Tomoyuki Yamakami (Univ. of Fukui.) COMP2009-25 |
We discuss the power and limitation of various "advice," when it is given particularly to weak computational models of o... [more] |
COMP2009-25 pp.1-8 |
COMP |
2009-09-14 11:15 |
Tottori |
Tottori University of Environmental Studies |
Recognition of a Spanning Tree of DAGs by Tree Automata Akio Fujiyoshi (Ibaraki Univ.) COMP2009-26 |
In this article, we define that a DAG is accepted by a tree automaton if the DAG has a spanning tree accepted by the tre... [more] |
COMP2009-26 pp.9-12 |
COMP |
2009-09-14 13:00 |
Tottori |
Tottori University of Environmental Studies |
Adversarial Bandit Problems with Multiple Plays Taishi Uchiya, Atsuyoshi Nakamura, Mineichi Kudo (Hokkaidou Univ.) COMP2009-27 |
[more] |
COMP2009-27 pp.13-20 |
COMP |
2009-09-14 13:35 |
Tottori |
Tottori University of Environmental Studies |
Parameter acquisition of an evaluation function for games by reinforcement learning Yasuhiro Tajima (Okayama Pref Univ.) COMP2009-28 |
On finite two-person zero-sum perfect-information games, we can find the best move by minmax search
on the game tree wi... [more] |
COMP2009-28 pp.21-26 |
COMP |
2009-09-14 14:30 |
Tottori |
Tottori University of Environmental Studies |
On the possible patterns of inputs for block sorting Takashi Saso, Kojiro Kobayashi (Soka Univ.) COMP2009-29 |
Burrows--Wheeler transformation is a useful transformation that is used as a preprocessing for data compression, and blo... [more] |
COMP2009-29 pp.27-33 |
COMP |
2009-09-14 15:05 |
Tottori |
Tottori University of Environmental Studies |
Random Generation and Enumeration of Bipartite Permutation Graphs Toshiki Saitoh (JAIST), Yota Otachi (Gunma Univ.), Katsuhisa Yamanaka (Univ. of Electro-Comm), Ryuhei Uehara (JAIST) COMP2009-30 |
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite
... [more] |
COMP2009-30 pp.35-42 |
COMP |
2009-09-14 15:40 |
Tottori |
Tottori University of Environmental Studies |
A Rooted-forest Partition with Uniform Vertex Demand and Its Application to the Rigidity Theory Naoki Katoh, Shin-ichi Tanigawa (Kyoto Univ.) COMP2009-31 |
A rooted-forest is a graph having self-loops such that each connected component contains exactly one loop, which is rega... [more] |
COMP2009-31 pp.43-50 |
|
|
|
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]
|