|
|
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 |
2023-12-22 10:50 |
Miyazaki |
Miyazaki Univ. Machinaka Campus |
On the minimization of quasi M^natural-convex functions Kazuo Murota (ISM, TMU), Akiyoshi Shioura (Tokyo Tech) COMP2023-18 |
For a class of discrete quasi convex functions called semi-strictly quasi M♮-convex functions, we investigate fundamenta... [more] |
COMP2023-18 pp.12-19 |
COMP |
2018-12-12 10:50 |
Miyagi |
Tohoku University |
Minimization of an M-convex Function under L1-distance Constraint Akiyoshi Shioura (Tokyo Inst. Tech.) COMP2018-33 |
In this paper we consider a new problem of minimizing an M-convex function under L1-distance constraint (MML1); the cons... [more] |
COMP2018-33 pp.15-20 |
COMP |
2014-12-05 10:30 |
Kumamoto |
Sojo University |
Energy Optimization in Speed Scaling Models via Submodular Optimization Akiyoshi Shioura (Tohoku Univ.), Natalia V. Shakhlevich (Univ. of Leeds), Vitaly A. Strusevich (Univ. of Greenwich) COMP2014-33 |
[more] |
COMP2014-33 pp.9-16 |
COMP |
2014-04-24 15:50 |
Miyagi |
Tohoku University |
Time Complexity Analysis of Iterative Auctions with Multiple Differentiated Items Kazuo Murota (Univ. of Tokyo), Akiyoshi Shioura (Tohoku Univ.), Zaifu Yang (Univ. of York) COMP2014-7 |
[more] |
COMP2014-7 pp.45-51 |
COMP |
2012-10-31 09:30 |
Miyagi |
Tohoku University |
A Uniied View to Greedy Geometric Routing Algorithms in Ad Hoc Networks Jinhee Chun, Akiyoshi Shioura, Truong Minh Tien, Takeshi Tokuyama (Tohoku Univ.) COMP2012-34 |
The main aim of this paper is to give a unified view to
greedy geometric routing algorithms
in ad hoc networks.
... [more] |
COMP2012-34 pp.1-8 |
COMP, IPSJ-AL |
2012-05-14 14:25 |
Ehime |
Ehime University |
Dijkstra Algorithm Viewed from Discrete Convex Analysis Kazuo Murota (Univ. of Tokyo), Akiyoshi Shioura (Tohoku Univ.) COMP2012-10 |
[more] |
COMP2012-10 pp.39-43 |
COMP |
2011-10-21 16:25 |
Miyagi |
Tohoku Univ. |
Maximization of Gross Substitutes Utility Function under Budget Constraints Akiyoshi Shioura (Tohoku Univ.) COMP2011-35 |
[more] |
COMP2011-35 pp.47-54 |
COMP |
2010-09-29 15:45 |
Niigata |
Nagaoka Univ. of Tech. |
Neighbor Systems
-- Algorithms and the Relationship with Jump Systems and Bisubmodular Polyhedra -- Akiyoshi Shioura (Tohoku Univ.) COMP2010-30 |
[more] |
COMP2010-30 pp.45-52 |
COMP |
2009-04-17 09:45 |
Kyoto |
Kyoto Univ. |
On the Complexity of Optimal Allocation of Indivisible Goods with Second-Order Utility Functions Akiyoshi Shioura, Takuji Yoshida (Tohoku Univ.) COMP2009-1 |
In this paper, we consider an allocation problem of goods which arises from the combinatorial auction of indivisible goo... [more] |
COMP2009-1 pp.1-6 |
COMP |
2008-10-10 16:15 |
Miyagi |
Tohoku Univ. |
Divide-and-Conquer Approach for Preemptive Scheduling Problems with Controllable Processing Times Natalia Shakhlevich (Univ. Leeds), Akiyoshi Shioura (Tohoku Univ.), Vitaly Strusevich (Univ. Greenwich) COMP2008-45 |
[more] |
COMP2008-45 pp.85-92 |
COMP |
2005-10-19 10:10 |
Miyagi |
Tohoku Univ. |
An Approximate Algorithum for Pricing European-Asian Options Takehisa Sekino, Akiyoshi Shioura, Takeshi Tokuyama (Tohoku Univ.) |
[more] |
COMP2005-46 pp.13-18 |
|
|
|
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]
|