37171770
A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems
5075607
Scheduling by Genetic Local Search with Multi-Step Crossover
In this paper, multi-step crossover (MSX) and a local search method are unied as a single operator called MSXF. MSX and MSXF utilize a neighborhood structure and a distance measure in the search space. In MSXF, a solution, initially set to be one of the parents, is stochastically replaced by a relatively good solution in the neighbor- hood, where the replacement is biased toward the other parent. After a certain number of iterations of this process, the best solution from those generated is selected as an ospring. Using job-shop scheduling problem benchmarks, MSXF was evaluated in a GA framework as a high-level crossover working on the critical path of a schedule. Experiments showed promising performance for the proposed method.
20213893
Inductive Theorems for Higher-Order Rewriting
Based on the simply typed term rewriting framework, inductive reasoning in higher-order rewriting is studied. The notion of higher-order inductive theorems is introduced to reflect higher-order feature of simply typed term rewriting. Then the inductionless induction methods in first-order term rewriting are incorporated to verify higher-order inductive theorems. In order to ensure that higher-order inductive theorems are closed under contexts, the notion of higher-order sufficient completeness is introduced. Finally, the decidability of higher-order sufficient completeness is discussed.
40096000
The Joinability and Unification Problems for Confluent Semi-constructor TRSs
The unification problem for term rewriting systems (TRSs) is the problem of deciding, for a TRS R and two terms s and t, whether s and t are unifiable modulo R. Mitsuhashi et al. have shown that the problem is decidable for confluent simple TRSs. Here, a TRS is simple if the right-hand side of every rewrite rule is a ground term or a variable. In this paper, we extend this result and show that the unification problem for confluent semi-constructor TRSs is decidable. Here, a semi-constructor TRS is such a TRS that every subterm of the right-hand side of each rewrite rule is ground if its root is a defined symbol. We first show the decidability of joinability for confluent semi-constructor TRSs. Then, using the decision algorithm for joinability, we obtain a unification algorithm for confluent semi-constructor TRSs.
17842240
Nanotechnology in the development of future computing systems
Nanoelectronics based on carbon nanotubes and organic molecules as the conducting material has been receiving increasing attention as an alternative to silicon CMOS based computing technology. These new device technologies require development of novel circuits and architectures to be technically feasible and economically viable. We provide an overview of this subject along with opportunities and challenges.