In this paper, we place new bounds on $CPT$ violation in the solar neutrino sector analyzing results from experiments and KamLAND. We also discuss sensitivity of next-generation DUNE Hyper-Kamiokande, which will provide accurate measurements oscillation parameters. The joint analysis both further improve precision due to cancellations systematic uncertainties regarding flux. combination with re...

A graph G is said to be hyper-connected if the removal of every minimum cut creates exactly two connected components, one of which is an isolated vertex. In this paper, we first generalize the concept of hyper-connected graphs to that of semi-hyper-connected graphs: a graph G is called semi-hyper-connected if the removal of every minimum cut of G creates exactly two components. Then we characte...

Hyper-heuristics are methodologies used to search the space of heuristics for solving computationally di cult problems. We describe an object-oriented domain analysis for hyper-heuristics that orthogonally decomposes the domain into generative policy components. The framework facilitates the recursive instantiation of hyper-heuristics over hyper-heuristics, allowing further exploration of the p...

We compare deterministic finite automata (DFAs) and biautomata under the following two aspects: structural similarities between minimal and hyper-minimal automata, and computational complexity of the minimization and hyper-minimization problem. Concerning classical minimality, the known results such as isomorphism between minimal DFAs, and NL-completeness of the DFA minimization problem carry o...

This paper investigates a tabu assisted genetic algorithm based hyper-heuristic (hyper-TGA) for personnel scheduling problems. We recently introduced a hyper-heuristic genetic algorithm (hyper-GA) with an adaptive length chromosome which aims to evolve an ordering of low-level heuristics in order to find good quality solutions to given problems. The addition of a tabu method, the focus of this ...