NP-Hard problem
Service Based Uses in Hybrid Clouds Using NP Hard Problem E Ravi Kumar & K Kotaiah Swamy
... In this paper, weconsidered hosting and communications costs as criteriafor service bursting of SBAs in hybrid clouds. We tackled in this paper a NP-hard problem re- latedto the bursting of a ...
6
Optimal content replication and request matching in large caching systems
... the problem of computing the optimal replication policy which if combined with the optimal matching policy maximizes the throughput of the caching system in the stationary ...an NP-hard ...the ...
10
SPACE-AGE APPROACH TO TRANSMIT MEDICAL IMAGE WITH CODEBASE CRYPTOSYSTEM OVER NOISY CHANNEL
... McEliece proposed the first public-key cryptosystem (the McEliece Scheme) based on algebraic coding theory in 1978[1] . The idea behind McEliece public-key cryptosystem is based on the fact that the decoding ...
6
An Analysis of New Optimization Algorithm for Different Combinatorial Problems
... The problem is to assign the beds automatically to the patients depend upon the priority, appropriate departments, medical needs ...this problem. the most widely used NP-hard problem ...
6
A Zero-Knowledge Proof Based on a Multivariate Polynomial Reduction of the Graph Isomorphism Problem
... Isomorphism problem (GI), where a prover must convince the verifier that he knows an isomorphism between two isomorphic graphs without publishing the ...the NP-hard problem of finding the ...
9
Approximate and online multi issue negotiation
... the problem is for the agents to decide how to allocate the issues between themselves so as to maximize their in- dividual ...an NP-hard problem, even in a complete information ...
8
Cellular Neural Networks for NP-Hard Optimization
... The energy landscape of spin-glasses is very complicated, there are many local minima, and finding the ground state is in most of the cases an NP-hard problem. The exceptions are the systems defined ...
7
A Novel Three-Phase Approach for Solving Multi-Depot Vehicle Routing Problem with Stochastic Demand
... Routing Problem (MDVRP), an extension of classical VRP, is a NP-hard problem for simultaneously determining the routes for several vehicles from multiple depots to a set of customers with ...
5
A Polynomial-Time Key-Recovery Attack on MQQ Cryptosystems
... Multivariate quadratic (MQ) public key schemes are cryptosystems based on the NP-hard problem of solving polynomial systems of quadratic equations over finite fields, also known as the ...
19
COMPARATIVE STUDY OF GA AND ACO FOR SOLVING TRAVELLING SALESMAN PROBLEMShivali Puri, Dr. Baljit Singh Khehra
... solving hard and complex problems for many ...world NP hard problems like Travelling Salesman Problem(TSP), Knapsack Problem, Vehicle Routing ...optimization problem is ...
5
A fixed point iterative approach to integer programming and its distributed computation
... an NP-hard problem, and the method can be applied to compute all integer or mixed-integer points in a polytope and directly extended to convex nonlinear integer ...
15
Minimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop
... a problem could not get the optimal solution in 4000 seconds, then B&B procedure will be stopped and its result will be ...an NP-hard problem; however, this increment is not related to job ...
10
Practical Witness Encryption for Algebraic Languages Or How to Encrypt Under Groth-Sahai Proofs
... all NP-languages either require new assumptions on multilinear maps (as in [Zha16]) yielding impractical instantia- tions, or yields practical instantiations but for very restricted languages (which are not ...
28
Multi-Scenarios Dynamic Matching Algorithm for Hierarchical Treatment System
... In the model, the optimization result is the maximum matching of bipartite graph. The constraint (20) shows that any subject A 7 8 only can match with 1 subject in set B, constraint shows that any subject B can only ...
12
Task Scheduling in Cloud Computing: Review
... the problem of task scheduling described as the assigning all the data of task to all resources in cloud computing environment makes the total cost and time of processing and communication to ...
5
Complexity of n-Queens completion (extended abstract)
... -Queens problem is to place n chess queens on an n by n chessboard so that no two queens are on the same row, column or ...Completion problem is a variant, dating to 1850, in which some queens are already ...
5
NP completeness of a combinator optimisation problem
... Suppose we have a function f written as a combinator expression. We consider the size |f| of the com- binator expression to be the number of occurrences of atoms (combinators or variables) in it. Suppose f evaluates, ...
28
NP Completeness of a combinator optimisation problem
... Using the combinators S, K, I, B, C, S', B' and C', together with a rewrite system for a graph representation of combinator expressions such that reduction of a duplicator causes the dup[r] ...
35
Solution of P versus NP problem
... Abstract This paper, taking Travelling Salesman Problem as our object, wishes to develop a constructive algorithm to prove P=NP. Our algorithm is described as this process: initially, constructing a convex ...
7
On unicyclic graphs of metric dimension \(2\)
... The notion of a metric basis was introduced by L. Blumenthal in [1] for semimetric spaces. F. Harary and R. Melter considered the concepts of a metric basis and metric dimension for simple, connected graphs in [2]. In ...
7