No.1 No.2 No.3 No.4
|
| Vol.47 No.1 |
A POLYNOMIAL-TIME ALGORITHM FOR THE GENERALIZED INDEPENDENT-FLOW PROBLEM
Akinobu Eguchi（Panasonic Mobile Communications Co., Ltd.），Satoru Fujishige（Kyoto University），Takashi Takabatake（Kochi Gakuen College） |
A NEW CHARACTERIZATION OF M-CONVEX SET FUNCTIONS BY SUBSTITUTABILITY
Rashid Farooq, Akihisa Tamura（Kyoto University） |
EVALUATING ALL BERTRAND-NASH EQUILIBRIA IN A DISCRETE SPATIAL DUOPOLY MODEL
Nobuo Matsubayashi（NTT Communications），Masashi Umezawa（University of Tsukuba），Yasushi Masuda, Hisakazu Nishino（Keio University） |
PERFORMANCE EVALUATION OF SECURE GROUP COMMUNICATION
Hiroshi Toyoizumi, Matsuyoshi Takaya（University of Aizu） |
COMPARISON OF CYCLIC AND DELAYED MAINTENANCES FOR A PHASED ARRAY RADAR
Kodo Ito（Mitsubishi Heavy Industries, LTD.），Toshio Nakagawa（Aichi Institute of Technology） |
▲ |
| Vol.47 No.2 |
GLOBAL CONVERGENCE RESULTS OF A NEW THREE-TERM MEMORY GRADIENT METHOD
Sun Qingying, Liu Xinhai（University of Petroleum） |
A DEA- COMPROMISE PROGRAMMING MODEL FOR COMPREHENSIVE RANKING
Akihiro Hashimoto, De-An Wu（University of Tsukuba） |
REMARKS ON THE CONCURRENT CONVERGENCE METHOD FOR A TYPICAL MUTUAL EVALUATION SYSTEM
Kazuyuki Sekitani（Shizuoka University），Hiromitsu Ueta（Shizuoka Police） |
ON A DOMINANCE TEST FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH RELEASE DATES TO MINIMIZE TOTAL FLOW TIME
Shuzo Yanai, Tetsuya Fujie（Kobe University of Commerce） |
AN O(n2 log2 n) ALGORITHM FOR INPUT-OR-OUTPUT TEST IN DISJUNCTIVE SCHEDULING
Yuichiro Miyamoto（Sophia University），Takeaki Uno（National Institute of Informatics），Mikio Kubo（Tokyo University of Marine Science and Technology） |
LINEAR TIME APPROXIMATION ALGORITHM FOR MULTICOLORING LATTICE GRAPHS WITH DIAGONALS
Yuichiro Miyamoto（Sophia University），Tomomi Matsui（University of Tokyo） |
▲ |
| Vol.47 No.3 |
MODELING BURST TRAFFIC USING A MAP WITH A TREE STRUCTURE
Shoichi Nishimura（Tokyo University of Science），Miyuki Shinno（NTT Advanced Technology Corporation） |
EXISTENCE CONDITIONS OF THE OPTIMAL STOPPING TIME: THE CASES OF GEOMETRIC BROWNIAN MOTION AND ARITHMETIC BROWNIAN MOTION
Hajime Takatsuka（Kagawa University） |
MULTI-AGENT-BASED MODELING OF ARTIFICIAL STOCK MARKETS BY USING THE CO-EVOLUTIONARY GP APPROACH
Xiaorong Chen（Shanghai Jiaotong University），Shozo Tokinaga（Kyushu University） |
A ROBUST BOOSTING METHOD FOR MISLABELED DATA
Natsuki Sano, Hideo Suzuki, Masato Koda（University of Tsukuba） |
▲ |
| Vol.47 No.4 |
Editorial Introduction
Takao Asano |
GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS
Hiroshi Nagamochi（Kyoto University） |
NA-EDGE-CONNECTIVITY AUGMENTATION PROBLEMS BY ADDING EDGES
Hiroyoshi Miwa（Kwansei Gakuin University），Hiro Ito（Kyoto University） |
A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS
Maiko Shigeno（University of Tsukuba） |
SOLVING LARGE SCALE OPTIMIZATION PROBLEMS VIA GRID AND CLUSTER COMPUTING
Katsuki Fujisawa（Tokyo Denki University），Masakazu Kojima, Akiko Takeda（Tokyo Institute of Technology）， Makoto Yamashita（Kanagawa University） |
AN OVERVIEW OF SOME STOCHASTIC STABILITY METHODS
Serguei Foss, Takis Konstantopoulos（Heriot-Watt University） |
STABILITY OF A SIMPLE RE-ENTRANT LINE WITH INFINITE SUPPLY OF WORK - THE CASE OF EXPONENTIAL PROCESSING TIMES
Gideon Weiss（The University of Haifa） |
UPPER BOUND FOR THE DECAY RATE OF THE MARGINAL QUEUE-LENGTH DISTRIBUTION IN A TWO-NODE MARKOVIAN QUEUEING SYSTEM
Kenichi Katou（The University of Electro-Communications），Naoki Makimoto（The University of Tsukuba），Yukio Takahashi（Tokyo Institute of Technology） |
BOUNDS FOR CALL COMPLETION PROBABILITIES IN LARGE-SCALE MOBILE COMMUNICATION NETWORKS
Toshihisa Ozawa（Komazawa University），Nariaki Takahashi（ITOCHU TECHNO-SCIENCE Corporation），Yukio Takahashi（Tokyo Institute of Technology） |
STATISTICAL MULTIPLEXING OF REGULATED SOURCES HAVING DETERMINISTIC SUBADDITIVE ENVELOPES
Kiwamu Nakamura, Shigeo Shioda（Chiba University） |
PERFORMANCE ANALYSIS OF DYNAMIC LIGHTPATH CONFIGURATION FOR SYMMETRIC WDM RING NETWORKS
Takuji Tachibana, Shoji Kasahara（Nara Institute of Science and Technology） |
▲ |
