| 2008 |
|---|
| 11 | EE | Jun Sakuma,
Shigenobu Kobayashi:
Large-Scale k-Means Clustering with User-Centric Privacy Preservation.
PAKDD 2008: 320-332 |
| 2007 |
|---|
| 10 | EE | Jun Sakuma,
Shigenobu Kobayashi:
A genetic algorithm for privacy preserving combinatorial optimization.
GECCO 2007: 1372-1379 |
| 9 | EE | Ken Harada,
Jun Sakuma,
Shigenobu Kobayashi,
Isao Ono:
Uniform sampling of local pareto-optimal solution curves by pareto path following and its applications in multi-objective GA.
GECCO 2007: 813-820 |
| 2006 |
|---|
| 8 | EE | Ken Harada,
Jun Sakuma,
Isao Ono,
Shigenobu Kobayashi:
Constraint-Handling Method for Multi-objective Function Optimization: Pareto Descent Repair Operator.
EMO 2006: 156-170 |
| 7 | EE | Ken Harada,
Jun Sakuma,
Shigenobu Kobayashi:
Local search for multiobjective function optimization: pareto descent method.
GECCO 2006: 659-666 |
| 2005 |
|---|
| 6 | EE | Jun Sakuma,
Shigenobu Kobayashi:
Latent variable crossover for k-tablet structures and its application to lens design problems.
GECCO 2005: 1347-1354 |
| 5 | EE | Shin Ando,
Jun Sakuma,
Shigenobu Kobayashi:
Adaptive isolation model using data clustering for multimodal function optimization.
GECCO 2005: 1417-1424 |
| 4 | EE | Jun Sakuma,
Shigenobu Kobayashi:
Real-coded crossover as a role of kernel density estimation.
GECCO 2005: 703-710 |
| 3 | EE | Michael E. Houle,
Jun Sakuma:
Fast Approximate Similarity Search in Extremely High-Dimensional Data Sets.
ICDE 2005: 619-630 |
| 2002 |
|---|
| 2 | | Jun Sakuma,
Shigenobu Kobayashi:
k-tablet Structures and Crossover on Latent Variables for Real-Coded GA.
GECCO Late Breaking Papers 2002: 404-411 |
| 2000 |
|---|
| 1 | | Jun Sakuma,
Shigenobu Kobayashi:
Extrapolation-Directed Crossover for Job-shop Scheduling Problems: Complementary Combination with JOX.
GECCO 2000: 973-980 |
