Drawing Borders Efficiently (2009)
Iwama, Kazuo, Miyano, Eiji, Ono, Hirotaka, 岩間, 一雄, 宮野, 英次, 小野, 廣隆, ...
A spreadsheet, especially MS Excel, is probably one of the most popular software applications for personal-computer users and gives us convenient and user-friendly tools for drawing tables. Using...
Graph Orientation Algorithms to (2008)
Minimize The Maximum, Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guard arrangement for...
Computational Complexity Issues in (2008)
Yuuki Kiyonari, Eiji Miyano, Shuichi Miyazaki
this paper we focus on restriction (2), which is a soft constraint: We want to find a feasible schedule which minimizes the total number of movements of all professors
On Approximation of Bookmark Assignments (2007)
Asahiro, Yuichi, Miyano, Eiji, Murata, Toshihide, Ono, Hirotaka, 朝廣, 雄一, 宮野, 英次, ...
Mathematical Foundations of Computer Science 2007
Graph orientation algorithms to minimize the maximum outdegree (2007)
Asahiro, Yuichi, Miyano, Eiji, Ono, Hirotaka, Zenmyo, Kouhei, 朝廣, 雄一, 宮野, 英次, ...
The Bump Hunting Method Using the Genetic Algorithm with the Extreme-Value Statistics (2006)
YUKIZANE, Takahiro, OHI, Shin-ya, MIYANO, Eiji, HIROSE, Hideo
In difficult classification problems of the z-dimensional points into two groups giving 0-1 responses due to the messy data structure, we try to find the denser regions for the favorable customers of...
New bounds for oblivious mesh routing (1998)
Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
We give two, new upper bounds for oblivious permutation routing on the mesh networks: Let N be the total number of processors in each mesh. One is an O(N
New bounds for oblivious mesh routing (1998)
Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
We give two, new upper bounds for oblivious permutation routing on the mesh networks: Let N be the total number of processors in each mesh. One is an O(N 0.75) algorithm on the two-dimensional, √ N...