partitioning problem
Applying a Parallel Solution to the Graph Partitioning Problem in the Simulation of Multiphase Flows
... Graph Partitioning Problem (GPP) has several practical applications in many areas, such as design of VLSI (Very-large-scale integration) circuits, solution of numerical methods for simulation problems that ...
6
A counterexample on a group partitioning problem
... 52 ≤ r ≤ 62. We shall use an algorithmic approach to show that the group partitioning approach cannot be used to improve Chung’s lower bound to r for 52 ≤ r ≤ 62. There are 56 groups of order from 51 up to 61. So ...
9
A two level graph partitioning problem arising in mobile wireless communications
... k-partition problem is an N P-hard combinatorial optimisation problem with many ...this problem, one having both node and edge variables, and the other having only edge ...
21
Soft Computing Approach for digital Circuit Layout based on Graph Partitioning
... Efficient designing of any complex system necessitates decomposition of the same into a set of smaller subsystem. Subsequently, each subsystem can be designed independently and simultaneously to speed up the design ...
5
Algorithm for Linear Number Partitioning into Maximum Number of Subsets
... It reminds me one of the cherished customs of childhood which needs to choose up sides for a ball game. Where two chief bullies of the neighbourhood would appoint themselves captains of the opposite teams and then they ...
6
Solving Digital Circuit Layout Problem based on Graph Partitioning Technique: A Glance
... multi-way partitioning are NP complete problems, which suggest that polynomial time algorithms for these are also unlikely to ...of problem solutions grows exponentially with the problem size and ...
5
A causal framework for explaining the predictions of black box sequence to sequence models
... We interpret the predictions of any black- box structured input-structured output model around a specific input-output pair. Our method returns an “explanation” con- sisting of groups of input-output tokens that are ...
10
Incremental Graph Partitioning Based on MapReduce
... they use a linear programming-based method to solve the incremental graph partitioning problem. Their calculations are carried out in a single server, and they are still limited by the size of the graph. ...
6
Free Indexation: Combinatorial Analysis and A Compositional Algorithm
... By relating the problem to the n-set partitioning problem, we show that free indexation must produce an exponential number of referentially distinct phrase structures given a structure w[r] ...
6
Energy and Synchronization Aware Mapping of Real Time Tasks on Asymmetric Multicore Platforms
... after partitioning the tasks among processors, the multiprocessor scheduling problem is reduced to a set of traditional uniprocessor ...the problem of partitioning tasks among multiple ...
6
New Approach for Hardware/Software Embedded System Conception Based on the Use of Design Patterns
... the partitioning between hardware and software aspects and the ...complexity problem. The partitioning problem deals with the proposed hardware/software partitioning algorithm based on ...
11
Approach Multiclass SVM Utilizing Genetic Algorithms
... programming problem becomes quickly computationally expensive, in terms of storage and CPU ...the problem dimension which is, in our case, the number of training patterns ...
6
Data Partitioning Method for Mining Frequent Itemset Using MapReduce
... A partitioning technique is used for automatic partitioning of mapreduce input phase and a locality scheduling is done at the reduce tasks simultaneously so it reduce the amount of data shuffling between ...
8
Partitioning POMDPs for multiple input types, and their application to dialogue managers
... that partitioning a POMDP model can improve the time taken to simulate a POMDP, making it three times faster in this particular ...via partitioning, whenever independent partitions can be ...
66
HBase Testing and Performance on Cluster Mode
... and Partitioning is there but Availability is not ...and Partitioning maintaining why because partitioning when ever storing the data in a single place , can‘t store large amount of data, that means ...
8
Logarithmic perspective shadow maps
... When the angle between the two edges of a side face is high, coordinate frame adjustment may provide little improvement (see the red face in Figure 5.17c). One possibility for handling this situation is to simply place a ...
192
Water Marking Relational Databases Using Optimization Based Techniques
... A watermark describes information that can be used to prove the ownership of data, such as the owner, origin, or recipient of the content. Secure embedding requires that the embedded watermark must not be easily ...
5
Reducing the Interprocessors Migrations of the EKG Algorithm
... 1. Introduction. There are two basic approaches for scheduling real-time tasks on multiprocessor / multi-core plat- forms: global and partitioned scheduling. In partitioned scheduling, tasks are organized in groups, and ...
8
An Analysis for the Detection of Network Communities in Dynamic Environments
... The first algorithm that finds both overlapping communities and the hierarchical structure was proposed by Lancichinetti [1]. Recently,finding communities and their evolutions in dynamic networks has gained more and more ...
5
On the Problem of Bandwidth Partitioning in FDD Block-Fading Single-User MISO/SIMO Systems
... the problem of how to optimally partition the available bandwidth of frequency division duplex, multi-input single-output communication systems, into subbands for the uplink, the downlink, and the ...bandwidth ...
13