Information and Systems-Theoretical Foundations of Computing(Date:2001/03/09)

Presentation
表紙

,  

[Date]2001/3/9
[Paper #]
目次

,  

[Date]2001/3/9
[Paper #]
Correctness of Optimized Transition Rules for Waksman's Firing Squad Synchronization Algorithm

Takashi Sogabe,  Yukihiro Nomura,  Hiroshi Umeo,  

[Date]2001/3/9
[Paper #]COMP2000-73
Linear- and Real-Time Prime Generation Algorithms on 1-Bit Cellular Automaton

Naoki Kamikawa,  Hiroshi UMEO,  

[Date]2001/3/9
[Paper #]COMP2000-74
On extended simple recurrent networks equivalent real-time DPDAs

Junnosuke Moriya,  Tetsuro Nishino,  

[Date]2001/3/9
[Paper #]COMP2000-75
Tree to String Transducer

Daisuke Ohta,  Ikuo Kawaharada,  Takumi Kasai,  

[Date]2001/3/9
[Paper #]COMP2000-76
Broadcast Scheduling for Heterogeneous Cluster Systems

Fukuhito OOSHITA,  Susumu MATSUMAE,  Nobuki TOKURA,  

[Date]2001/3/9
[Paper #]COMP2000-77
Parallel Application of Task Scheduling Algorithm BCSH to a Large Fine-grained Taskgraph Divided by Level

Kouichi Nishimura,  Noriyuki Fujimoto,  Kenichi Hagihara,  

[Date]2001/3/9
[Paper #]COMP2000-78
Efficient Generation of Plane Triangulations without Repetitions

Zhangjian Li,  Shin-ichi Nakano,  

[Date]2001/3/9
[Paper #]COMP2000-79
Exprimental Evalutation of Algorithms for Finding All Pairs Shortest Paths

Kazutoshi FURUKAWA,  

[Date]2001/3/9
[Paper #]COMP2000-80
A polynomial time approximation scheme for the minimum maximal matching problem in planar graphs

Hiroshi Nagamochi,  Yukihiro Nishida,  Toshihide Ibaraki,  

[Date]2001/3/9
[Paper #]COMP2000-81
A Property of Inclusion-Exclusion for a Family of Small Sets and Its Application

Kenshi Matsuo,  Syunei Shiono,  Kazuyuki Amano,  Akira Maruoka,  

[Date]2001/3/9
[Paper #]COMP2000-82
Some Results on Finding Meaningful Association Rules in Data Mining

Teppei Matsuyama,  Ryuichi Nakanishi,  Minoru Ito,  Michio Nakanishi,  

[Date]2001/3/9
[Paper #]COMP2000-83
Complexity of Extracting Database Schema from Semistructured Documents

Nobutaka Suzuki,  Yoichirou Sato,  Michiyoshi Hayase,  

[Date]2001/3/9
[Paper #]COMP2000-84
An Improvement on a Multi-layer Data Structure Based on a BD tree

Satoru NAKANO,  Sumio MASUDA,  Kazuaki YAMAGUCHI,  

[Date]2001/3/9
[Paper #]COMP2000-85
A Parameter of k-opt Local Search Heuristics for the Binary Quadratic Programming Problem

Keiko KOHMOTO,  Kengo KATAYAMA,  Hiroyuki NARIHISA,  

[Date]2001/3/9
[Paper #]COMP2000-86
Complexity of Two Person Games with Unique Winning Strategy

Shin AIDA,  Tatsuie TSUKIJI,  

[Date]2001/3/9
[Paper #]COMP2000-87
The King Chase Problem of n×n Chess is EXPTIME-complete

Eiji YAMAGUCHI,  Tatsuie TSUKIJI,  Masaya YOKOTA,  

[Date]2001/3/9
[Paper #]COMP2000-88
PSPACE Problems with Unique Solutions

Marcel Crasmaru,  

[Date]2001/3/9
[Paper #]COMP2000-89
Experimental Evaluation of Running Times of SAT Algorithms

Yasushi Tachikawa,  Takao Asano,  

[Date]2001/3/9
[Paper #]COMP2000-90
12>> 1-20hit(21hit)