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

Presentation
表紙

,  

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

,  

[Date]2000/5/11
[Paper #]
An NCE Attribute Graph Grammar for Program Diagrams with Respect to Drawing Problems

Miyazaki Masahiro,  Ruise Kenji,  Tsuchida Kensei,  Yaku Takeo,  

[Date]2000/5/11
[Paper #]COMP2000-6
Fundamental Properties of Generalized Pushdown Tree Transducers

Sodeshima Yoshichika,  Yamasaki Katsunori,  

[Date]2000/5/11
[Paper #]COMP2000-7
Self-Verifying Nondeterministic and Las Vegas Multihead Finte Automata

Inoue Katsushi,  Tanaka Yasunori,  Ito Akira,  Wang Yue,  

[Date]2000/5/11
[Paper #]COMP2000-8
Lower Bounds for Communication Complexity of Private Information Retrieval

ITOH TOSHIYA,  

[Date]2000/5/11
[Paper #]COMP2000-9
A competitive algorithm for network caching and its design methodology

Tani Seiichiro,  

[Date]2000/5/11
[Paper #]COMP2000-10
On Fundamental Design of Iterated Local Search Heuristic for Binary Quadratic Programming

KATAYAMA Kengo,  NARIHISA Hiroyuki,  

[Date]2000/5/11
[Paper #]COMP2000-11
A Comparison of Genetic Local Search Algorithms for Binary Quadratic Programming

KATAYAMA Kengo,  TANI Masafumi,  NARIHISA Hiroyuki,  

[Date]2000/5/11
[Paper #]COMP2000-12
Effects of Genetic Crossover by Greedy Operation

KOHMOTO Keiko,  KATAYAMA Kengo,  NARIHISA Hiroyuki,  

[Date]2000/5/11
[Paper #]COMP2000-13
[OTHERS]

,  

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