IEICE Technical Report

Print edition: ISSN 0913-5685      Online edition: ISSN 2432-6380

Volume 110, Number 464

Theoretical Foundations of Computing

Workshop Date : 2011-03-09 / Issue Date : 2011-03-02

[PREV] [NEXT]

[TOP] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [2013] | [Japanese] / [English]

[PROGRAM] [BULK PDF DOWNLOAD]


Table of contents

COMP2010-47
The Digital Principle and the Listening Automaton -- The Mechanisms to generate human evolutions --
Kimiaki Tokumaru (System Engineer)
pp. 1 - 8

COMP2010-48
Communication-Efficient Broadcast on Markovian Evolving Graphs
Kei Matsubara, Taisuke Izumi, Koichi Wada (NIT)
pp. 9 - 15

COMP2010-49
New k shortest simple path algorithm that reduces the average case time complexity
Hiroshi Matsuura (NTT)
pp. 17 - 24

COMP2010-50
Evaluation of metaheuristic algorithms for Spanning Tree Congestion
Daiki Maruta (Gunma Univ.), Yota Otachi (Tohoku Univ.), Koichi Yamazaki (Gunma Univ.)
pp. 25 - 28

COMP2010-51
Constant-time approximation algorithms for the knapsack problem
Hiro Ito, Susumu Kiyoshima, Yuichi Yoshida (Kyoto Univ.)
pp. 29 - 36

COMP2010-52
Recognition of Basic Planar Objects Using Computational Geometry Methods
Yoshihiro Hirashiki, Tetsuo Asano (JAIST)
pp. 37 - 44

COMP2010-53
Algorithms for Covering Digraphs by Length-Bounded Paths
Kenji Sejima, Takuro Fukunaga, Hiroshi Nagamochi (Kyoto Univ.)
pp. 45 - 51

COMP2010-54
Reconfiguration of List Edge-Colorings in a Tree
Kazuto Kawamura, Takehiro Ito, Xiao Zhou (Tohoku Univ.)
pp. 53 - 60

Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan