Kazuo Iwano - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2017

Wisdom Service Systems: Harmonious Interactions Between People and MachineMd. Abul Kalam Siddike, Kazuo Iwano, Kazuyoshi Hidaka, Youji Kohda, Jim Spohrer. ahfe 2018: 115-127 [doi]

2015

Research area on intelligent systems creating co-experience knowledge and wisdom with human-machine "harmonious" collaborationNorihiro Hagita, Miwako Doi, Kazuo Iwano, Hideyuki Tokuda, Yukiko Horikawa. huc 2015: 897-898 [doi]

2007

Applying Autonomic Computing with Open Standardized Resource Interface WSDM to Managing Multi-vendor IT SystemsYoshikazu Satoh, Yuhsuke Kaneyasu, Jung-Kook Hong, Yuhichi Komatsu, Kazuo Iwano, Satoshi Tutiya, Tsuneo Katsuyama, Hiroshi Yoshida. im 2007: 655-669 [doi]

2005

Self-Adaptable Autonomic Computing Systems: An Industry ViewWolfgang Gentzsch, Kazuo Iwano, Duncan Johnston-Watt, Mughees A. Minhas, Mazin S. Yousif. dexaw 2005: 201-205 [doi]

1999

Finding Subsets Maximizing Minimum StructuresMagnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama. siamdm, 12(3):342-359, 1999. [doi]

New TSP Construction Heuristics and Their Relationships to the 2-OptHiroyuki Okano, Shinji Misono, Kazuo Iwano. heuristics, 5(1):71-88, 1999.

1997

A New Probabilistic Analysis of Karger s Randomized Algorithm for Minimum Cut ProblemsYang Dai, Kazuo Iwano, Naoki Katoh. ipl, 64(5):255-261, 1997. [doi]

New TSP Construction Heuristics and Their Relationships to the 2-OptHiroyuki Okano, Shinji Misono, Kazuo Iwano. wads 1997: 150-159

1996

A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut AlgorithmsYang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh, Keiji Ohtsuka, Nobuhiko Yoshimura. DAM, 65(1-3):167-190, 1996. [doi]

1995

Finding Subsets Maximizing Minimum StructuresMagnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama. soda 1995: 150-159

Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the planeNaoki Katoh, Kazuo Iwano. ijcga, 5:37-51, 1995.

On Minimum and Maximum Spanning Trees of Linearly Moving PointsNaoki Katoh, Takeshi Tokuyama, Kazuo Iwano. dcg, 13:161-176, 1995.

1994

A New Scaling Algorithm for the Maximum Mean Cut ProblemKazuo Iwano, Shinji Misono, Shu Tezuka, Satoru Fujishige. algorithmica, 11(3):243-255, 1994.

The Traveling Cameraman Problem, with Applications to Automatic Optical InspectionKazuo Iwano, Prabhakar Raghavan, Hisao Tamaki. isaac 1994: 29-37

Efficient algorithms for minimum range cut problemsNaoki Katoh, Kazuo Iwano. networks, 24(7):395-407, 1994. [doi]

1993

How to Treat Delete Requests in Semi-Online ProblemsYang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh. isaac 1993: 48-57

Efficient Algorithms for Finding the Most Vital Edge of a Minimum Spanning TreeKazuo Iwano, Naoki Katoh. ipl, 48(5):211-213, 1993.

1992

Finding ::::k:::: Farthest Pairs and ::::k:::: Closest/Farthest Bichromatic Pairs for Points in the PlaneNaoki Katoh, Kazuo Iwano. compgeom 1992: 320-329 [doi]

On Minimum and Maximum Spanning Trees of Linearly Moving PointsNaoki Katoh, Takeshi Tokuyama, Kazuo Iwano. focs 1992: 396-405

1991

A Speculative Contraction Method for Minimum Cost Flows: Toward a Practical AlgorithmSatoru Fujishige, Kazuo Iwano, J. Nakano, Shu Tezuka. dimacs 1993: 219-246

Efficient Algorithms for the Minimum Range Cut Problem (Extended Abstract)Naoki Katoh, Kazuo Iwano. wads 1991: 80-91

1990

Efficient Sequential and Parallel Algorithms for Planar Minimum Cost FlowHiroshi Imai, Kazuo Iwano. sigal 1990: 21-30

An Efficient Algorithm for Optimal Loop ParallelizationKazuo Iwano, Susan Yeh. sigal 1990: 201-210

A Semiring on Convex Polygons and Zero-Sum Cycle ProblemsKazuo Iwano, Kenneth Steiglitz. SICOMP, 19(5):883-901, 1990.

1989

An Improvement of Goldberg, Plotkin and Vaidya s Maximal Node-Disjoint Paths AlgorithmKazuo Iwano. ipl, 32(1):25-27, 1989.

1988

Planarity testing of doubly periodic infinite graphsKazuo Iwano, Kenneth Steiglitz. networks, 18(3):205-222, 1988. [doi]

1987

Testing for Cycles in Infinite Graphs with Periodic Structure (Extended Abstract)Kazuo Iwano, Kenneth Steiglitz. stoc 1987: 46-55

1986

Optimization of one-bit full adders embedded in regular structuresKazuo Iwano, Kenneth Steiglitz. tsp, 34(5):1289-1300, 1986. [doi]

1985

Time-power-area tradeoffs for the nMOS VLSI full-adderKazuo Iwano, Kenneth Steiglitz. icassp 1985: 1453-1456 [doi]

Sign in or sign up to see more results.

runs on WebDSL