|
|
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 |
2021-03-08 15:15 |
Online |
Online |
A hyper-heuristic for the maximum clique problem Kazuho Kanahara, Kengo Katayama (OUS), Etsuji Tomita (UEC) COMP2020-34 |
The maximum clique problem (MCP) is one of the most important combinatorial optimization problems that has many practica... [more] |
COMP2020-34 pp.30-37 |
COMP |
2019-09-02 11:25 |
Okayama |
Tsushima Campus, Okayama University |
Speeding-up of Construction Algorithms for the Graph Coloring Problem Kazuho Kanahara, Kengo Katayama (OUS), Etsuji Tomita (UEC), Takeshi Okano, Takahumi Miyake, Noritaka Nishihara (OUS) COMP2019-11 |
DSATUR and RLF are well known as typical solution construction algorithms for the graph coloring problem, GCP, where GCP... [more] |
COMP2019-11 pp.7-14 |
|
|
|
Copyright and reproduction :
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
|
[Return to Top Page]
[Return to IEICE Web Page]
|