 | 2011 |
| 25 |  | Hisashi Handa:
Dimensionality reduction of scene and enemy information in Mario.
IEEE Congress on Evolutionary Computation 2011: 1515-1520 |
| 2010 |
| 24 |  | Hisashi Handa,
Hiroshi Kawakami:
Dimension reduction by Manifold Learning for Evolutionary Learning with redundant sensory inputs.
IEEE Congress on Evolutionary Computation 2010: 1-6 |
| 23 |  | Norio Baba,
Hisashi Handa,
Mariko Kusaka,
Masaki Takeda,
Yuriko Yoshihara,
Keisuke Kogawa:
Utilization of Evolutionary Algorithms for Making COMMONS GAME Much More Exciting.
KES (3) 2010: 555-561 |
| 22 |  | Hisashi Handa:
Experimental Analysis of the Effect of Dimensionality Reduction on Instance-Based Policy Optimization.
PRICAI 2010: 433-444 |
| 21 |  | Tokue Nishimura,
Hisashi Handa:
Rule acquisition for cognitive agents by using estimation of distribution algorithms.
IJKESDP 2(3): 224-236 (2010) |
| 20 |  | Hisashi Handa:
Constitution of Ms.PacMan player with critical-situation learning mechanism.
IJKESDP 2(3): 237-250 (2010) |
| 2009 |
| 19 |  | Hisashi Handa:
EDA-RL: estimation of distribution algorithms for reinforcement learning problems.
GECCO 2009: 405-412 |
| 18 |  | Hisashi Handa:
Solving Multi-objective Reinforcement Learning Problems by EDA-RL - Acquisition of Various Strategies.
ISDA 2009: 426-431 |
| 2008 |
| 17 |  | Norio Baba,
Kenta Nagasawa,
Hisashi Handa:
Utilization of Soft Computing Techniques for Making Environmental Games More Exciting -Toward an Effective Utilization of the COMMONS GAME.
KES (2) 2008: 411-417 |
| 2007 |
| 16 |  | Norio Baba,
Lakhmi C. Jain,
Hisashi Handa:
Advanced Intelligent Paradigms in Computer Games
Springer 2007 |
| 15 |  | Hisashi Handa,
Norio Baba:
Evolutionary Computations for Designing Game Rules of the COMMONS GAME.
CIG 2007: 334-339 |
| 14 |  | Hidetsugu Suto,
Hiroshi Kawakami,
Hisashi Handa:
A Study of Information Flow Between Designers and Users Via Website Focused on Property of Hyper Links.
HCI (8) 2007: 189-198 |
| 13 |  | Hisashi Handa:
Evolutionary Computation on Multitask Reinforcement Learning Problems.
ICNSC 2007: 685-688 |
| 12 |  | Hisashi Handa:
Estimation of distribution algorithms with niche separation mechanism.
IEEE Congress on Evolutionary Computation 2007: 119-126 |
| 11 |  | Norio Baba,
Hisashi Handa:
COMMONS GAME Made More Exciting by an Intelligent Utilization of the Two Evolutionary Algorithms.
Advanced Intelligent Paradigms in Computer Games 2007: 1-16 |
| 10 |  | Hisashi Handa,
Lee Chapman,
Xin Yao:
Robust Salting Route Optimization Using Evolutionary Algorithms.
Evolutionary Computation in Dynamic and Uncertain Environments 2007: 497-517 |
| 9 |  | Hisashi Handa:
The effectiveness of mutation operation in the case of Estimation of Distribution Algorithms.
Biosystems 87(2-3): 243-251 (2007) |
| 2006 |
| 8 |  | Hisashi Handa:
Fitness function for finding out robust solutions on time-varying functions.
GECCO 2006: 1195-1200 |
| 2005 |
| 7 |  | Hisashi Handa,
Lee Chapman,
Xin Yao:
Dynamic salting route optimisation using evolutionary computation.
Congress on Evolutionary Computation 2005: 158-165 |
| 6 |  | Hisashi Handa:
Estimation of Distribution Algorithms with Mutation.
EvoCOP 2005: 112-121 |
| 2004 |
| 5 |  | Hisashi Handa:
Mutation Can Improve the Search Capability of Estimation of Distribution Algorithms.
GECCO (2) 2004: 396-397 |
| 2003 |
| 4 |  | Hisashi Handa:
Hybridization of Estimation of Distribution Algorithms with a Repair Method for Solving Constraint Satisfaction Problems.
GECCO 2003: 991-1002 |
| 2002 |
| 3 |  | Hisashi Handa,
Mitsuru Baba,
Tadashi Horiuchi,
Osamu Katai:
A Novel Hybrid Framework of Coevolutionary GA and Machine Learning.
International Journal of Computational Intelligence and Applications 2(1): 33-52 (2002) |
| 2 |  | Mitsuru Baba,
Tadataka Konishi,
Hisashi Handa:
Shape measurement of columnar objects with specular surfaces by slit ray projection method.
Systems and Computers in Japan 33(4): 50-60 (2002) |
| 1999 |
| 1 |  | Hisashi Handa,
Osamu Katai,
Tadataka Konishi,
Mitsuru Baba:
Coevolutionary Genetic Algorithms for Solving Dynamic Constraint Satisfaction Problems.
GECCO 1999: 252-257 |