#### Filter Results:

#### Publication Year

2000

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Takayuki Yoshizumi, Teruhisa Miura, Toru Ishida
- AAAI/IAAI
- 2000

The multiple sequence alignment problem is one of the important problems in Genome Informatics. The notable feature of this problem is that its state-space forms a lattice. Researchers have applied search algorithms such as A* and memory-bounded search algorithms including SNC to this problem. Unfortunately, previous work could align only seven sequences at… (More)

- Takayuki Yoshizumi
- AAAI
- 2015

The solutions or states of optimization problems or simulations are evaluated by using objective functions. The weights for these objective functions usually have to be estimated from experts' evaluations, which are likely to be qualitative and somewhat subjective. Although such estimation tasks are normally regarded as quite suitable for machine learning,… (More)

- Takayuki Yoshizumi, Hiroyuki Okano
- 2007 Winter Simulation Conference
- 2007

In a supply chain, there are wide variety of problems, such as transportation scheduling problems and warehouse location problems. These problems are independently defined as optimization problems, and algorithms have been proposed for each problem. It is difficult, however, to design an algorithm for optimizing a supply chain simultaneously because the… (More)

The Modal-Shift Transportation Planning Problem (MSTPP) is the problem that finds a feasible schedule for carriers with the minimum total cost when sets of facilities, delivery orders, and carriers are given. In this paper, we propose a fast steepest descent algorithm to solve the MSTPP. Our solution generates a set of candidate routes for each delivery… (More)

—We introduce Delay Pruning, a simple yet powerful technique to regularize dynamic Boltzmann machines (DyBM). The recently introduced DyBM provides a particularly structured Boltzmann machine, as a generative model of a multi-dimensional time-series. This Boltzmann machine can have infinitely many layers of units but allows exact inference and learning… (More)

- Ryo Hirade, Takayuki Yoshizumi
- ICPR
- 2012

- Masami Amano, Takayuki Yoshizumi, Hiroyuki Okano
- Winter Simulation Conference
- 2003

The Modal-Shift Transportation Planning Problem (MSTPP) is the problem that finds a feasible schedule for carriers with the minimum total cost when sets of facilities, delivery orders, and carriers are given. In this paper, we propose a fast steepest descent algorithm to solve the MSTPP. Our solution generates a set of candidate routes for each delivery… (More)

- ‹
- 1
- ›