Prune-and-search with limited workspace

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Prune-and-search with limited workspace

Prune-and-search is an excellent algorithmic paradigm for solving various optimization problems. We provide a general scheme for prune-and-search technique and show how to implement it in space-efficient manner. We consider both the in-place and read-only model which have several advantages compared to the traditional model of computation. Our technique can be applied to a large number of probl...

متن کامل

Selection from Read-Only Memory with Limited Workspace

Given an unordered array of N elements drawn from a totally ordered set and an integer k in the range from 1 to N , in the classic selection problem the task is to find the k-th smallest element in the array. We study the complexity of this problem in the space-restricted random-access model: The input array is stored on read-only memory, and the algorithm has access to a limited amount of work...

متن کامل

Curvature-constrained motion within a limited workspace

We pose the following questions: Given two points within a closed area W C R2, each with a prescribed direction of motion in it, (i) what is the shortest path of bounded curvature that joints them and lies completely in W? (ii) what is the minimum number of cusps one needs to design a path in W? This kind of questions appear in various applications, such as robot motion planning. The proposed a...

متن کامل

Using Combinatorics to Prune Search Trees: Independent and Dominating Set

We introduce a surprisingly simple technique to design and analyze algorithms based on search trees, that significantly improves many existing results in the area of exact algorithms. The technique is based on measuring the progress of Branch & Bound algorithms by making use of a combinatorial relation between the average and maximum dual degrees of a graph. By dual degree of a vertex, we mean ...

متن کامل

Branch-and-Prune Search Strategies for Numerical Constraint Solving

Xuan-Ha VU, Marius-Călin SILAGHI, Djamila SAM-HAROUD and Boi FALTINGS 1 Cork Constraint Computation Centre, University College Cork (UCC), 14 Washington Street West, Cork, Ireland, Email: [email protected]; 2 Department of Computer Science, Florida Institute of Technology (FIT), 150 West University Boulevard, Melbourne, FL-32901-6975, USA Email: [email protected]; 3 Artificial Intelligenc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 2015

ISSN: 0022-0000

DOI: 10.1016/j.jcss.2014.08.001