Information and Systems-Theoretical Foundations of Computing(Date:2000/09/11)

Presentation
表紙

,  

[Date]2000/9/11
[Paper #]
目次

,  

[Date]2000/9/11
[Paper #]
An abductive procedure with adjusting and infinite derivations

Yoshinori Kurose,  Susumu Yamasaki,  

[Date]2000/9/11
[Paper #]COMP2000-34
An improvement of LAESA to find nearest neighbors

Yoichi KONDO,  Kazuaki YAMAGUCHI,  Eiichi TANAKA,  

[Date]2000/9/11
[Paper #]COMP2000-35
A Fair Assignment Algorithm for Class Assignment Problems

Takayuki KITA,  Tosimitu SHIBAYAMA,  Kazuaki YAMAGUCHI,  Sumio MASUDA,  

[Date]2000/9/11
[Paper #]COMP2000-36
On a cycle decomposition of de Bruijn degraphs

Yosuke Kikuchi,  Yukio Shibata,  

[Date]2000/9/11
[Paper #]COMP2000-37
Reconstruction Algorithm of the Shortest Path by Dijkstra Method for Multilink Disconnections

Takayuki Aoki,  Shigetomo Kimura,  Yoshihiko Ebihara,  

[Date]2000/9/11
[Paper #]COMP2000-38
An Algorithm for Placing Vertex Labels in a Graph Drawing

Gento KIKUCHI,  Sumio MASUDA,  Kazuaki YAMAGUCHI,  

[Date]2000/9/11
[Paper #]COMP2000-39
Avoiding Faulty Privileges with Time-adaptive Fault Containment

Jun Kiniwa,  

[Date]2000/9/11
[Paper #]COMP2000-40
Polynomially fast parallel algorithms for some P-complete problems

Carla Denise Castanho,  Wei Chen,  Koichi Wada,  Akihiro Fujiwara,  

[Date]2000/9/11
[Paper #]COMP2000-41
[OTHERS]

,  

[Date]2000/9/11
[Paper #]