نتایج جستجو برای: conquer
تعداد نتایج: 3972 فیلتر نتایج به سال:
Divide and Conquer (DC) is conceptually well suited to high-dimensional optimization by decomposing a problem into multiple small-scale subproblems. However, appealing performance can be seldom observed when the sub-problems are interdependent. This paper suggests that the major difficulty of tackling interdependent sub-problems lies in the precise evaluation of a partial solution (to a sub-pro...
We describe the SVP data model. The goal of SVP is to model both set and stream data, and to model parallelism in bulk data processing. SVP also shows promise for other parallel processing applications. SVP models collections, which include sets and streams as special cases. Collections are represented as ordered tree structures, and divide-and-conquer mappings are easily deened on these struct...
Though the divide-and-conquer algorithm is a powerful technology, but it is difficult to be used in practice, so the design of this algorithm should be regulated in the teaching. In this article, the teaching process and the characters of the divide-and-conquer algorithm are studied when solving the problem of chessboard coverage. Aiming at the deficiency that the existing teaching method uses ...
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we propose to use measure and conquer also as a tool in the design of algorithms. In an iterative process, we obtain a series of branch and reduce algorithms. A mathematical analysis of an algorithm in the series with m...
We present performance evaluations of parallel-for loop with work stealing technique. The parallel-for by work stealing transforms the parallel-loop into a form of binary tree by making use of method of divide-and-conquer. Iterations are distributed in the leaves procedures of the binary tree, and the parallel executions are performed by stealing subtrees from the bottom of the tree. The work s...
Seirogan, a popular anti-diarrhoeal pill, is arguably one of the most successful pharmaceutical products of modern Japan. What is less known is that the Japanese army initially developed Seirogan during the Russo-Japanese War as the ‘Conquer-Russia-Pill’, which was later marketed to the public by private manufacturers. Previous scholars have emphasised the top–down governmental method of mobili...
In mobile ad hoc peer-to-peer (M-P2P) networks, economic models become a necessity for enticing non-cooperative mobile peers to provide service. M-P2P users may issue queries with varying constraints on query response time, data quality of results and trustworthiness of the data source. Hence, we propose ConQuer, which is an economic incentive model for the efficient processing of constraint qu...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید