10542004
Investigation of the Fitness Landscapes and Multi-parent Crossover for Graph Bipartitioning
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 correlations and the properties around the central area of local optima. The study revealed some new notable results about the properties of the fitness landscape; e.g., the central area yielded fairly good quality in the local-optimum space. We performed an experiment on a spectrum of different exploitation strengths of the central areas. From the results, it seems attractive to exploit the central area, but excessive or insufficient exploitation is not desirable.
17681470
New Usage of Sammon's Mapping for Genetic Visualization
It is a hard problem to understand the fitness landscape of a problem as well as the evolution of genetic algorithms. For the purpose, we adopt Sammon's mapping for the investigation. We demonstrate its usefulness by applying it to the graph partitioning problem which is a well-known NP-hard problem. Also, through the investigation of schema traces, we explain the genetic process and the reordering effect in the genetic algorithm.
15690106
Genetic Search For Fixed Channel Assignment Problem With Limited Bandwidth
We propose a hybrid genetic algorithm for the fixed channel assignment problem with limited bandwidth. A local optimization algorithm was devised to enhance the genetic algorithm's fine-tunning. In a matrix representation, the local optimization algorithm improves on a chromosome by horizontal and vertical moves of channels. The crossover is directly performed on two-dimensional matrices. Experimental results showed dramatic improvement against previous works.
27587473
Generalized cycle crossover for graph partitioning
We propose a new crossover that generalizes cycle crossover to permutations with repetitions and naturally suits partition problems. We tested it on graph partitioning problems obtaining excellent results.
344302
New topologies for genetic search space
We propose three distance measures for genetic search space. One is a distance measure in the population space that is useful for understanding the working mechanism of genetic algorithms. Another is a distance measure in the solution space for K-grouping problems. This can be used for normalization in crossover. The third is a level distance measure for genetic algorithms, which is useful for measuring problem difficulty with respect to genetic algorithms. We show that the proposed measures are metrics and the measures are efficiently computed.
21112002
A backward approach in list scheduling algorithms for multi-machine tardiness problems
Abstract List scheduling algorithms are commonly used for multi-machine scheduling problems, especially for those with precedence relationships among operations. In most list scheduling algorithms, operations are scheduled forward. In this paper, we suggest a backward approach in which the operations are scheduled backward. We discuss some details that must be considered when applying the backward approach to problems with due dates and suggest several methods of defining parameters needed in the backward approach. Performance of this approach is tested on job shop problems and identical machine problems with several types of precedence constaints.
80432
Resource sharing and pipelining in coarse-grained reconfigurable architecture for domain-specific optimization
Coarse-grained reconfigurable architectures aim to achieve goals of both high performance and flexibility. However, existing reconfigurable array architectures require many resources without considering the specific application domain. Functional resources that take long latency and/or large area can be pipelined and/or shared among the processing elements. Therefore, the hardware cost and the delay can be effectively reduced without any performance degradation for some application domains. We suggest such a reconfigurable array architecture template and a design space exploration flow for domain-specific optimization. Experimental results show that our approach is much more efficient, in both performance and area, compared to existing reconfigurable architectures.
35466192
Scheduling on parallel identical machines to minimize total tardiness
This paper focuses on the problem of scheduling n independent jobs on m identical parallel machines for the objective of minimizing total tardiness of the jobs. We develop dominance properties and lower bounds, and develop a branch and bound algorithm using these properties and lower bounds as well as upper bounds obtained from a heuristic algorithm. Computational experiments are performed on randomly generated test problems and results show that the algorithm solves problems with moderate sizes in a reasonable amount of computation time. � 2005 Elsevier B.V. All rights reserved.
18367763
Business process integration with Web services
Web services facilitate the creation of business process solutions in an efficient, standard way. The process solutions development with Web services requires the automation of discovery and composition of Web services. In this paper, we focus on the discovery of Web services based on the capabilities and properties of published services, and the composition of processes based on the requirements of submitted requests. We propose a solution which comprises multiple matching algorithms, first, a micro-level matching algorithm which matches the capabilities of services with activities in a process request, and, second, macro-level matching algorithms which are used to compose a business process by identifying services that satisfy the business requirements and constraints of the request. The solution from the macro-level matching algorithms is optimal in terms of meeting a certain business objective, e.g., minimizing the cost or execution time, or maximizing the total utility value of business properties of interest.
8647579
MediaStation 5000: integrating video and audio
MediaStation 5000 is a highly integrated desktop multimedia system implemented on a single PC plug-in board. It performs multistandard compression, high-speed image processing, and fast 2D and 3D graphics functions. The Texas instruments Multimedia Video Processor (MVP), a single-chip multiprocessing device with a highly parallel internal architecture, provides the system's processing power and programmability.<<ETX>>