There is a growing interest towards the design of reusable general purpose search methods that are applicable to different problems instead of tailored solutions to a single particular problem. Hyper-heuristics have emerged as such high level methods that explore the space formed by a set of heuristics (move operators) or heuristic components for solving computationally hard problems. A selecti...

Background: Periprosthetic hip infections (PHIs) are troublesome complications of hip arthroplasties. The gold standard procedure for treating chronic PHI is a 2-stage approach. Recently, however, more conservative approaches have been developed to spare the osseointegrated components and avoid sequestra, bone loss, devascularization, and difficult reconstructions. The partial ...

We solve the problem of decomposing a rectangle R into p rectangles of equal area so that the maximum rectangle perimeter is as small as possible. This work has applications in areas such as flexible object packing and data allocation. Our solution requires only a constant number of arithmetic operations and integer square roots to characterize the decomposition, and linear time to print the de...

This paper presents a hyper-heuristic approach which hybridises lowlevel heuristic moves to improve timetables. Exams which cause a soft-constraint violation in the timetable are ordered and rescheduled to produce a better timetable. It is observed that both the order in which exams are rescheduled and the heuristic moves used to reschedule the exams and improve the timetable affect the quality...

This paper deals with the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines at the first stage and a single machine at the second stage. At the first stage, jobs use some additional resources which are available in limited quantities at any time. The resource requirements are of 0-1 type. The objective is the minimization of makespan. The problem is NP-ha...

In the multiprocessing embedded framework the productive utilization of the on-chip and off-chip memory code repositioning is done. For the purpose of improvement in the embedded system the SPM and cache is used for the code processing. The code layout is developed to place the code in memory for preventing the cache conflicts and misses. Even though many researchers have illustrated the use of...

Allocation of rules to sites in a distributed deductive database system is an important and challenging task especially for a large knowledge base. We identify communication cost in rule execution to be the primary basis for decomposing a global knowledge base into clusters for their allocation to sites. We show that the problem of optimal allocation is a 0-1 quadratic programming problem, whic...

A graph G is called interval colorable if it has a proper edge coloring with colors 1,2,3,… such that the of edges incident to every vertex form an integers. Not all graphs are colorable; in fact, quite few families have been proved admit colorings. In this paper we introduce and investigate new notion, thickness G, denoted θint(G), which minimum number edge-disjoint subgraphs whose union G. Ou...

Spatial goals are becoming more frequent aspects of forest management plans as regulatory and organizational policies change in response to fi sheries and wildlife concerns. The combination of green-up constraints (harvesting restrictions that prevent the cutting of adjacent units for a specifi ed period of time) and habitat requirements for red-cockaded woodpeckers (RCW) in the southeastern U....