#### Filter Results:

- Full text PDF available (16)

#### Publication Year

2005

2018

- This year (1)
- Last 5 years (18)
- Last 10 years (31)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Xuan Liu, Hongmei He, Ondrej SÃ½kora
- ADMA
- 2005

In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String problem. Our implementation and experiments show usefulness of theâ€¦ (More)

- Hongmei He, Ondrej SÃ½kora
- 2005

In the circular (other alternate concepts are outerplanar, convex and one-page) drawing one places vertices of a nâˆ’vertex mâˆ’edge connected graph G along a circle, and the edges are drawn as straightâ€¦ (More)

- Hongmei He, O. Skora, E. Mkinen
- IEEE Transactions on Neural Networks
- 2006

The simplest graph drawing method is that of putting the vertices of a graph on a line and drawing the edges as half-circles either above or below the line. Such drawings are called two-page bookâ€¦ (More)

- Hongmei He, Zhenhuan Zhu, Erkki MÃ¤kinen
- IEEE Transactions on Neural Networks
- 2009

A wireless ad hoc sensor network consists of a number of sensors spreading across a geographical area. The performance of the network suffers as the number of nodes grows, and a large sensor networkâ€¦ (More)

- Richard M. Guest, Hongmei He, Sarah V. Stevenage, Greg J. Neil
- 2013 IEEE International Conference onâ€¦
- 2013

Biometric iris recognition systems are widely used for a range of identity recognition applications and have been shown to perform with high accuracy. For large-scale deployments, however, systemâ€¦ (More)

- Bryan Gardiner, Sonya A. Coleman, T. Martin McGinnity, Hongmei He
- Robotics and Autonomous Systems
- 2012

- Hongmei He, Ondrej SÃ½kora, Ana Salagean, Erkki MÃ¤kinen
- J. Parallel Distrib. Comput.
- 2007

Genetic algorithms (GAs) have been applied to solve the 2-page crossing number problem successfully, but since they work with one global population, the search time and space are limited.â€¦ (More)

- Hongmei He, Ana Salagean, Erkki MÃ¤kinen
- Int. J. Comput. Math.
- 2010

The simplest graph drawing method is that of putting the vertices of a graph on a line (spine) and drawing the edges as half-circles on k half planes (pages). Such drawings are called k-page bookâ€¦ (More)

- Jonathan Lawry, Hongmei He
- International Journal of Uncertainty, Fuzzinessâ€¦
- 2008

We propose label semantics as an integrated representation framework for probabilistic uncertainty and fuzziness in multiple-attribute decision making problems. Linguistic attribute hierarchies areâ€¦ (More)

- Hongmei He, Ondrej SÃ½kora, Ana Salagean
- Parallel and Distributed Computing and Networks
- 2006

Genetic algorithms have been applied to solve the 2-page drawing problem successfully, but they work with one global population, so the search time and space are limited. Parallelization provides anâ€¦ (More)