In this paper we provide a rigorous convergence analysis of a “off”-policy temporal difference learning algorithm with linear function approximation and per time-step linear computational complexity in “online” learning environment. The algorithm considered here is TDC with importance weighting introduced by Maei et al. We support our theoretical results by providing suitable empirical results ...

This paper investigates the off-line use of the dependency structure matrix genetic algorithm (DSMGA). In particular, a problemspecific crossover operator is design by performing dependency structure matrix (DSM) analysis. The advantages and disadvantages of such an off-line use are discussed. Two schemes that helps the off-line usage are proposed. Finally, those off-line schemes are demonstrat...

When applying PDE algorithm according to the complexity of the image, the problem is how to get complexity of the image. J.N. Kim and et al. proposed one method, which results in significant reduced computation with the same predicted image quality of the conventional FS [1]. But by localizing the image well, we can get more the reduction of unnecessary computation. In general, image complexity...

Off-line signature verification methods have to tackle with a number of high resolution images, therefore it is vital to use efficient image processing algorithms. This paper proposes a heuristic stroke extraction algorithm to create a compact representation of the signature whilst minimizing the loss of semantic information and the computational needs. Some issues of the algorithm are highligh...

Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...

Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

Background: Irreversible electroporation (IRE) is a novel tumor ablation technique. IRE is associated with high electrical fields and is often reported in conjunction with thermal damage caused by Joule heating. For good response to surgery it is crucial to produce minimum thermal damage in both tumoral and healthy tissues named Non-Thermal Irreversible Electroporation(NTIRE). Non-thermal irrev...

Complexity results and algorithms are given for the problem of maximizing the number of off vertices (switches) in graphs and m×n rectangular grids. When a switch is toggled, it and its neighbors change state. It is shown that the problem is NP-complete in graphs and a simple approximation algorithm is given as well as a nonapproximability result. Fixed-parameter problems are studied in grids a...