background: acute appendicitis is one of the common and urgent illnesses among children.  children usually are unable to help the physicians completely due to weakness in describing the medical history. moreover, acute appendicitis overlaps with conditions of other diseases in terms of symptoms and signs in the first hours of presentation. these conditions lead to unwanted biases as well as err...

Well-engineered compilers use a carefully selected set of optimizations, heuristic optimization policies, and a phase ordering to produce good machine code. Designing a compiler with one heuristic per optimization that works well with other optimization phases is a challenging task. Although compiler designers evaluate the optimization heuristics and phase ordering before deployment, compilers ...

Opportunistic activity recognition as research discipline is characterized by the fact that human activities (and more generally the context) shall be recognized with sensors that are initially unknown to the system. In contrast to “traditional” applications— where sensors, their modalities, locations, and working characteristics have to be defined at design time—opportunistic systems do not re...

The vehicle routing problem (VRP) is a known optimization problem. The objective is to construct an optimal set of routes serving a number of customers where the demand of each customer is less than the vehicle’ capacity, and each customer is visited exactly once like in TSP problem. The purpose of this paper is to present new deterministic heuristic and its stochastic version for solving the v...

We focus on the two-center hybrid flow shop scheduling problem with identical parallel machines and removal times. The job removal time is the required duration to remove it from a machine after its processing. The objective is to minimize the maximum completion time (makespan). A heuristic and a lower bound are proposed for this NP-Hard problem. These procedures are based on the optimal soluti...

We present the first planner capable of reasoning with both the full semantics of PDDL2.1 (level 3) temporal planning and with numeric resources. Our planner, CRIKEY3, employs heuristic forward search, using the start-and-end semantics of PDDL2.1 to manage temporal actions. The planning phase is interleaved with a scheduling phase, using a Simple Temporal Network, in order to ensure that tempor...

Most high-dimensional indexing structures proposed for similarity query in content-based image retrieval (CBIR) systems are tree-structured. The quality of a high-dimensional tree-structured index is mainly determined by its insertion algorithm. Our approach focuses on an important phase in insertion, that is, the tree descending phase, when the tree is explored to nd a host node to accommodate...

Neuro-imaging is an excellent tool to provide important diagnosis on mental pathology. Magnetic resonance(MR) image is an essential data processed in the neuro-imaging. Since the MR signal is obtained by oscillating magnetic fields in a special radio frequency region, the extraction procedure of MRI relies on complicated digital signal processing. The reconstruction of 3-D volume data from raw ...

We consider the problem of scheduling a single machine to minimize total tardiness with sequence dependent setup times. We present two algorithms, a problem space-based local search heuristic and a Greedy Randomized Adaptive Search Procedure (GRASP) for this problem. With respect to GRASP, our main contributions are—a new cost function in the construction phase, a new variation of Variable Neig...