We present a new algorithm for non-unitary approximate joint diagonalization (AJD), based on a “natural gradient”-type multiplicative update of the diagonalizing matrix, comple...
We propose a two-phase heuristic for crossing reduction in circular layouts. While the first algorithm uses a greedy policy to build a good initial layout, an adaptation of the si...
With the widespread use of embedded devices such as PDAs, printers, game machines, cellular telephones, achieving high performance demands an optimized operating system (OS) that ...
Mahmut T. Kandemir, Guangyu Chen, Wei Zhang 0002, ...
This paper proposes a method for dealing with numerical attributes in inductive concept learning systems based on genetic algorithms. The method uses constraints for restricting th...
An empirical study is performed on the local-optimum space of graph bipartitioning. We examine some statistical features of the fitness landscape. They include the cost-distance c...