preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. in this paper, the same problem has been considered in which objective is to minimize the mean flow time. to prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. o...

Preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. In this paper, the same problem has been considered in which objective is to minimize the mean flow time. To prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. O...

Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...

presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. the method is easy to u...

Interpreters designed for efficiency execute a huge number of indirect branches and can spend more than half of the execution time in indirect branch mispredictions. Branch target buffers are the best widely available form of indirect branch prediction; they produce 50%–100% mispredictions for existing interpreters. In this paper we investigate three methods for improving the prediction accurac...

we consider online scheduling of jobs with specic release time on m identical machines. each job has a weight and a size; the goal is maximizing total weight of completed jobs. at release time of a job it must immediately be scheduled on a machine or it will be rejected. it is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contr...

Combining linear programming approach with the Plotkin-Johnson argument for constant weight codes, we derive upper bounds on the size of codes of length n and minimum distance d = (n j)=2, 0 < j < n 1=3 . For j = o(n 1=3 ) these bounds practically coincide (are slightly better) with the Tietav ainen bound. For xed j and j proportional to n 1=3 , j < n 1=3 (2=9) lnn, it improves on the earlier...

Video sequences of real-world situations are often di cult to track with machine vision. Scenes frequently contain visual clutter, repetitive textures and occlusions that make online visual feature tracking di cult. If the camera is allowed to shake or moving objects are present, the exponential searchspace of potential feature matches rapidly becomes intractable for real-time applications. In ...