|
|
|
|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
|
| Search Results: Conference Papers |
| Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
|
| Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
| COMP |
2006-04-26
16:20 |
Kyoto |
Kyoto University |
An exact algorithm for the label placement problem
Yuichi Inoue, Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) |
Given sites on a map and their labels with specified size, the label placement problem is to find an appropriate placeme... [more] |
COMP2006-9
pp.63-67 |
| PRMU, TL |
2006-02-23
10:00 |
Ibaraki |
|
A Cell Extraction Method for Form Documents using Intersection Features
Hiroshi Tanaka, Hiroaki Takebe, Katsuhito Fujimoto (Fujitsu Labs.) |
This paper describes a cell extraction method for form documents base on combinatorial optimization of cell candidates u... [more] |
TL2005-50 PRMU2005-185
pp.7-12 |
| COMP |
2005-09-15
15:10 |
Osaka |
Osaka Univ., Toyonaka Campus |
An algorithm for generating vertex sequences to extract maximum weight cliques quickly
Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) |
Given an undirected graph with weight for each vertex, the maximum
weight clique problem is to find the clique of the ... [more] |
COMP2005-33
pp.39-42 |
| COMP |
2005-04-18
10:00 |
Hyogo |
Kwansei Gakuin Univ. |
A fast algorithm for calculating an upper bound of the weight of the maximum weighted clique
Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) |
We deal with the optimization problem that requies the maximum weighted
clique of undirected graphs. Some exact algori... [more] |
COMP2005-1
pp.1-4 |
| COMP |
2005-04-18
10:35 |
Hyogo |
Kwansei Gakuin Univ. |
Exact Algorithms for the Two-Dimensional Strip Packing Problem with Rotations
Mitsutoshi Kenmochi, Takashi Imamichi, Koji Nonobe, Mutsunori Yagiura, Hiroshi Nagamochi (Kyoto Univ.) |
We examine various strategies for exact approaches to the 2-dimensional strip packing problem (2SP) with and without rot... [more] |
COMP2005-2
pp.5-14 |
| COMP |
2005-04-18
11:10 |
Hyogo |
Kwansei Gakuin Univ. |
Branch-and-Bound Algorithms for MAX-2-SAT
Yuichi Koga, Koji Nonobe, Mutsunori Yagiura, Hiroshi Nagamochi (Kyoto Univ.), Toshihide Ibaraki (Kwansei Gakuin Univ.) |
MAX-2-SAT is one of the representative combinatorial problems and it is known to be NP-hard. It is stated as follows: Gi... [more] |
COMP2005-3
pp.15-24 |
| COMP |
2005-01-28
10:55 |
Aichi |
Nagoya University |
An Asynchronous Distributed Branch and Bound for Load Balancing
Atsushi Sasaki, Tadashi Araragi (NTT), Shigeru Masuyama (Toyohashi Univ. of Tech.) |
We propose a new asynchronous distributed branch and bound algorithm for a load balancing problem in which each variable... [more] |
COMP2004-63
pp.23-32 |
| IE, SIP, ICD, IPSJ-SLDM |
2004-10-22
15:50 |
Yamagata |
|
Bus architecture optimization method for IP-based design
Kyoko Ueda, Keishi Sakanushi, Noboru Yoneoka, Yoshinori Takeuchi, Masaharu Imai (Osaka Univ.) |
In IP-based design, to find the optimal bus architecture is very important problem because bus architecture strongly aff... [more] |
SIP2004-101 ICD2004-133 IE2004-77
pp.73-78 |
|
|
|
|
|
[Return to Top Page]
[Return to IEICE Web Page]
|