|
|
|
|
|
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2005)
|
|
|
|
Search Results: Keywords 'from:2005-04-18 to:2005-04-18'
|
| [Go to Official COMP Homepage (Japanese)] |
| Search Results: Conference Papers |
| Conference Papers (Available on Advance Programs) (Sort by: Date Ascending) |
|
|
| Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
| 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-04-18
13:15 |
Hyogo |
Kwansei Gakuin Univ. |
On time and space complexity of functions
Kenya Ueno (Univ. of Tokyo) |
Similar to the computable function class, it is known that many function complexity classes like $FP$ and $FPSPACE$
can... [more] |
COMP2005-4
pp.25-30 |
| COMP |
2005-04-18
13:50 |
Hyogo |
Kwansei Gakuin Univ. |
Quantum Algorithms for the Hidden Subgroup Problem over Semidirect Product Groups of Cyclic Groups
Yoshifumi Inui, Francois Le Gall (Univ. of Tokyo/JST) |
It is known that for some problems such as a factorization, there exist quantum algorithms exponentially or
subexponent... [more] |
COMP2005-5
pp.31-38 |
| COMP |
2005-04-18
14:25 |
Hyogo |
Kwansei Gakuin Univ. |
Truthful Auctions with Limited Ranges of Bids
Daisuke Sumita, Takashi Horiyama, Kazuo Iwama (Kyoto Univ.) |
[more] |
COMP2005-6
pp.39-47 |
| COMP |
2005-04-18
15:15 |
Hyogo |
Kwansei Gakuin Univ. |
On the Complexity of Inferring a Graph from Path Frequency
Tatsuya Akutsu, Daiji Fukagawa (Kyoto Univ.) |
We consider the problem of inferring a graph (and a sequence) from the numbers of occurrences of vertex-labeled paths, w... [more] |
COMP2005-7
pp.49-55 |
| COMP |
2005-04-18
15:50 |
Hyogo |
Kwansei Gakuin Univ. |
Lowering Eccentricity of a Tree by Node-Upgrading
Toshihide Ibaraki (Kwansei Gakuin Univ.), Xiao-Guang Yang (CAS) |
The eccentricity lowering is to reduce the eccentricity of a network by upgrading some nodes (i.e., shrinking the lengt... [more] |
COMP2005-8
pp.57-65 |
|
|
|
|
|
[Return to Top Page]
[Return to IEICE Web Page]
|