Conferences related to NP-hard problem

Back to Top

2021 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)

FUZZ-IEEE 2021 will represent a unique meeting point for scientists and engineers, both from academia and industry, to interact and discuss the latest enhancements and innovations in the field. The topics of the conference will cover all the aspects of theory and applications of fuzzy sets, fuzzy logic and associated approaches (e.g. aggregation operators such as the Fuzzy Integral), as well as their hybridizations with other artificial and computational intelligence techniques.


ICC 2021 - IEEE International Conference on Communications

IEEE ICC is one of the two flagship IEEE conferences in the field of communications; Montreal is to host this conference in 2021. Each annual IEEE ICC conference typically attracts approximately 1,500-2,000 attendees, and will present over 1,000 research works over its duration. As well as being an opportunity to share pioneering research ideas and developments, the conference is also an excellent networking and publicity event, giving the opportunity for businesses and clients to link together, and presenting the scope for companies to publicize themselves and their products among the leaders of communications industries from all over the world.


2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)

IEEE CCNC 2020 will present the latest developments and technical solutions in the areas of home networking, consumer networking, enabling technologies (such as middleware) and novel applications and services. The conference will include a peer-reviewed program of technical sessions, special sessions, business application sessions, tutorials, and demonstration sessions.


2020 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)

All topics related to engineering and technology management, including applicable analytical methods and economical/social/human issues to be considered in making engineering decisions.


2020 IEEE International Conference on Multimedia and Expo (ICME)

Multimedia technologies, systems and applications for both research and development of communications, circuits and systems, computer, and signal processing communities.

  • 2019 IEEE International Conference on Multimedia and Expo (ICME)

    speech, audio, image, video, text and new sensor signal processingsignal processing for media integration3D imaging, visualization and animationvirtual reality and augmented realitymulti-modal multimedia computing systems and human-machine interactionmultimedia communications and networkingmedia content analysis and searchmultimedia quality assessmentmultimedia security and content protectionmultimedia applications and servicesmultimedia standards and related issues

  • 2018 IEEE International Conference on Multimedia and Expo (ICME)

    The IEEE International Conference on Multimedia & Expo (ICME) has been the flagship multimedia conference sponsored by four IEEE societies since 2000. It serves as a forum to promote the exchange of the latest advances in multimedia technologies, systems, and applications from both the research and development perspectives of the circuits and systems, communications, computer, and signal processing communities. ICME also features an Exposition of multimedia products and prototypes.

  • 2017 IEEE International Conference on Multimedia and Expo (ICME)

    Topics of interest include, but are not limited to: – Speech, audio, image, video, text and new sensor signal processing – Signal processing for media integration – 3D visualization and animation – 3D imaging and 3DTV – Virtual reality and augmented reality – Multi-modal multimedia computing systems and human-machine interaction – Multimedia communications and networking – Media content analysis – Multimedia quality assessment – Multimedia security and content protection – Multimedia databases and digital libraries – Multimedia applications and services – Multimedia standards and related issues

  • 2016 IEEE International Conference on Multimedia and Expo (ICME)

    Topics of interest include, but are not limited to:- Speech, audio, image, video, text and new sensor signal processing- Signal processing for media integration- 3D visualization and animation- 3D imaging and 3DTV- Virtual reality and augmented reality- Multi-modal multimedia computing systems and human-machine interaction- Multimedia communications and networking- Media content analysis- Multimedia quality assessment- Multimedia security and content protection- Multimedia databases and digital libraries- Multimedia applications and services- Multimedia standards and related issues

  • 2015 IEEE International Conference on Multimedia and Expo (ICME)

    With around 1000 submissions and 500 participants each year, the IEEE International Conference on Multimedia & Expo (ICME) has been the flagship multimedia conference sponsored by four IEEE societies since 2000. It serves as a forum to promote the exchange of the latest advances in multimedia technologies, systems, and applications from both the research and development perspectives of the circuits and systems, communications, computer, and signal processing communities.

  • 2014 IEEE International Conference on Multimedia and Expo (ICME)

    The IEEE International Conference on Multimedia & Expo (ICME) has been the flagship multimedia conference sponsored by four IEEE societies since 2000. It serves as a forum to promote the exchange of the latest advances in multimedia technologies, systems, and applications. In 2014, an Exposition of multimedia products, prototypes and animations will be held in conjunction with the conference.Topics of interest include, but are not limited to:

  • 2013 IEEE International Conference on Multimedia and Expo (ICME)

    To promote the exchange of the latest advances in multimedia technologies, systems, and applications from both the research and development perspectives of the circuits and systems, communications, computer, and signal processing communities.

  • 2012 IEEE International Conference on Multimedia and Expo (ICME)

    IEEE International Conference on Multimedia & Expo (ICME) has been the flagship multimedia conference sponsored by four IEEE Societies. It exchanges the latest advances in multimedia technologies, systems, and applications from both the research and development perspectives of the circuits and systems, communications, computer, and signal processing communities.

  • 2011 IEEE International Conference on Multimedia and Expo (ICME)

    Speech, audio, image, video, text processing Signal processing for media integration 3D visualization, animation and virtual reality Multi-modal multimedia computing systems and human-machine interaction Multimedia communications and networking Multimedia security and privacy Multimedia databases and digital libraries Multimedia applications and services Media content analysis and search Hardware and software for multimedia systems Multimedia standards and related issues Multimedia qu

  • 2010 IEEE International Conference on Multimedia and Expo (ICME)

    A flagship multimedia conference sponsored by four IEEE societies, ICME serves as a forum to promote the exchange of the latest advances in multimedia technologies, systems, and applications from both the research and development perspectives of the circuits and systems, communications, computer, and signal processing communities.

  • 2009 IEEE International Conference on Multimedia and Expo (ICME)

    IEEE International Conference on Multimedia & Expo is a major annual international conference with the objective of bringing together researchers, developers, and practitioners from academia and industry working in all areas of multimedia. ICME serves as a forum for the dissemination of state-of-the-art research, development, and implementations of multimedia systems, technologies and applications.

  • 2008 IEEE International Conference on Multimedia and Expo (ICME)

    IEEE International Conference on Multimedia & Expo is a major annual international conference with the objective of bringing together researchers, developers, and practitioners from academia and industry working in all areas of multimedia. ICME serves as a forum for the dissemination of state-of-the-art research, development, and implementations of multimedia systems, technologies and applications.

  • 2007 IEEE International Conference on Multimedia and Expo (ICME)

  • 2006 IEEE International Conference on Multimedia and Expo (ICME)

  • 2005 IEEE International Conference on Multimedia and Expo (ICME)

  • 2004 IEEE International Conference on Multimedia and Expo (ICME)

  • 2003 IEEE International Conference on Multimedia and Expo (ICME)

  • 2002 IEEE International Conference on Multimedia and Expo (ICME)

  • 2001 IEEE International Conference on Multimedia and Expo (ICME)

  • 2000 IEEE International Conference on Multimedia and Expo (ICME)


More Conferences

Periodicals related to NP-hard problem

Back to Top

Automatic Control, IEEE Transactions on

The theory, design and application of Control Systems. It shall encompass components, and the integration of these components, as are necessary for the construction of such systems. The word `systems' as used herein shall be interpreted to include physical, biological, organizational and other entities and combinations thereof, which can be represented through a mathematical symbolism. The Field of Interest: shall ...


Communications Letters, IEEE

Covers topics in the scope of IEEE Transactions on Communications but in the form of very brief publication (maximum of 6column lengths, including all diagrams and tables.)


Communications, IEEE Transactions on

Telephone, telegraphy, facsimile, and point-to-point television, by electromagnetic propagation, including radio; wire; aerial, underground, coaxial, and submarine cables; waveguides, communication satellites, and lasers; in marine, aeronautical, space and fixed station services; repeaters, radio relaying, signal storage, and regeneration; telecommunication error detection and correction; multiplexing and carrier techniques; communication switching systems; data communications; and communication theory. In addition to the above, ...


Computational Biology and Bioinformatics, IEEE/ACM Transactions on

Specific topics of interest include, but are not limited to, sequence analysis, comparison and alignment methods; motif, gene and signal recognition; molecular evolution; phylogenetics and phylogenomics; determination or prediction of the structure of RNA and Protein in two and three dimensions; DNA twisting and folding; gene expression and gene regulatory networks; deduction of metabolic pathways; micro-array design and analysis; proteomics; ...


Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

Methods, algorithms, and human-machine interfaces for physical and logical design, including: planning, synthesis, partitioning, modeling, simulation, layout, verification, testing, and documentation of integrated-circuit and systems designs of all complexities. Practical applications of aids resulting in producible analog, digital, optical, or microwave integrated circuits are emphasized.


More Periodicals

Most published Xplore authors for NP-hard problem

Back to Top

Xplore Articles related to NP-hard problem

Back to Top

Formation Distance Problem in Multi-Agents Control

2012 Fifth International Conference on Intelligent Computation Technology and Automation, 2012

A new problem named formation distance problem (FDP) in multi-agents formation control is presented, with the aim to minimize the sum of distance all the agents traveled during every formation rebuilding process. By defining the formation distance matrix (FDM), we prove the FDP is an NP-hard problem. A recursion algorithm is described to exact solve the FDP, whose time complexity ...


K-Means Clustering Algorithm with Refined Initial Center

2009 2nd International Conference on Biomedical Engineering and Informatics, 2009

K-means algorithm is a popular method in clustering analysis. After reviewing the traditional K-means algorithm, we proposed an improved K-means algorithm. At first we select the Euclidean distance or Manhattan distance as distance measure in our algorithm through calculating the rule of distance measure. Different initial centroids lead to different results. So the next step we will select the initial ...


Neural network approach for general assignment problem

Proceedings of ICNN'95 - International Conference on Neural Networks, 1995

Discusses a neural network approach for the general assignment problem. This problem is the generalization of the well known assignment problem and can be formulated as a zero-one integer programming problem. The authors transform this zero-one integer programming problem into an equivalent nonlinear programming problem by replacing zero-one constraints with quadratic concave equality constraints. The authors propose two kinds of ...


Parallel ACO for DNA Sequencing by Hybridization

2009 WRI World Congress on Computer Science and Information Engineering, 2009

DNA sequencing by hybridization (SBH) is an important method in bioinformatics, and it has been proved to be a NP-hard problem in combinatorial optimization. It has two demerits which are the lower precision of solution and the lower speed of convergence in serial ACO, tabu search and evolutionary algorithm for DNA sequencing by hybridization. In this paper an improved parallel ...


Novel Method for Construction Enterprise Management Based on Improved ACO

2009 Second International Symposium on Computational Intelligence and Design, 2009

To solve the problem of resource allocation among the sub-enterprises in the management of construction enterprise, an improved ant colony optimization (ACO) algorithm based on entropy was introduced. After analyzing the feasibility of the usage of the algorithm, the allocation model was set up. Engineering practice shows that the method can realize the resource allocation efficiently with low cost and ...


More Xplore Articles

Educational Resources on NP-hard problem

Back to Top

IEEE-USA E-Books

  • Formation Distance Problem in Multi-Agents Control

    A new problem named formation distance problem (FDP) in multi-agents formation control is presented, with the aim to minimize the sum of distance all the agents traveled during every formation rebuilding process. By defining the formation distance matrix (FDM), we prove the FDP is an NP-hard problem. A recursion algorithm is described to exact solve the FDP, whose time complexity and space complexity are too large. In order to simplify the calculation, a so-called intelligent ant colony optimization (ACO) algorithm is used to solve this problem. The FDP is converted to modified traveling salesman problem (TSP) using topology knowledge firstly. Then the distance each agent traveled in the formation process is changed to the length between two nodes in the graph. Finally, the problem is converted to graph traversal problem, and a modified ACO algorithm is proposed to solve the FDP. Numerical Simulation results show the effectiveness of the presented algorithm.

  • K-Means Clustering Algorithm with Refined Initial Center

    K-means algorithm is a popular method in clustering analysis. After reviewing the traditional K-means algorithm, we proposed an improved K-means algorithm. At first we select the Euclidean distance or Manhattan distance as distance measure in our algorithm through calculating the rule of distance measure. Different initial centroids lead to different results. So the next step we will select the initial centroids which are consistent with the distribution of data. According to simulation, the improved K-means algorithm has can achieve higher accuracy and stability than the traditional ones.

  • Neural network approach for general assignment problem

    Discusses a neural network approach for the general assignment problem. This problem is the generalization of the well known assignment problem and can be formulated as a zero-one integer programming problem. The authors transform this zero-one integer programming problem into an equivalent nonlinear programming problem by replacing zero-one constraints with quadratic concave equality constraints. The authors propose two kinds of neural network structures based on a penalty function method and an augmented Lagrangian multiplier method, and compare them by theoretical analysis and numerical simulation. The authors show that the penalty function-based neural network approach is not good for the combinatorial optimization problem because it falls into the dilemma of terminating at an infeasible solution or sticking at any feasible solution, and that the augmented Lagrangian multiplier method- based neural network can alleviate this suffering in some degree.

  • Parallel ACO for DNA Sequencing by Hybridization

    DNA sequencing by hybridization (SBH) is an important method in bioinformatics, and it has been proved to be a NP-hard problem in combinatorial optimization. It has two demerits which are the lower precision of solution and the lower speed of convergence in serial ACO, tabu search and evolutionary algorithm for DNA sequencing by hybridization. In this paper an improved parallel ACO algorithm (IPACO) was proposed for DNA sequencing by hybridization in this paper. It shows a better performance compared with serial ACO, tabu search and evolutionary algorithm in precision and convergence based on the experiments.

  • Novel Method for Construction Enterprise Management Based on Improved ACO

    To solve the problem of resource allocation among the sub-enterprises in the management of construction enterprise, an improved ant colony optimization (ACO) algorithm based on entropy was introduced. After analyzing the feasibility of the usage of the algorithm, the allocation model was set up. Engineering practice shows that the method can realize the resource allocation efficiently with low cost and high profit. This study provides a new method for the construction enterprise management.

  • A further study on simplification of decision tables

    In traditional rough set theory, the simplification of a decision table was investigated and minimal algorithms were introduced to express its result. However, the optimization of minimal algorithms is still left aside. In this paper, we first propose an algorithm for computing all reducts of every decision rule in a decision table, and then we explore three optimal problems of minimal algorithms of a decision table. Specifically, we prove them to be NP-hard and give heuristic algorithms for solving them. Finally, these heuristic algorithms are programmed and demonstrated on three examples.

  • Protecting sensitive knowledge by data sanitization

    We address the problem of protecting some sensitive knowledge in transactional databases. The challenge is on protecting actionable knowledge for strategic decisions, but at the same time not losing the great benefit of association rule mining. To accomplish that, we introduce a new, efficient one-scan algorithm that meets privacy protection and accuracy in association rule mining, without putting at risk the effectiveness of the data mining per se.

  • Resource-constrained multi-project scheduling based on ant colony neural network

    The resource-constrained multi-project scheduling (RCMPS) is a NP-hard problem and has been extensively used in manufacturing and engineering fields. In order to solve scheduling of RCMPS, a new algorithm was presented in this paper. The new algorithm combines the some advantages of ACOA and NN . Finally, the algorithm was tested on a case of the RCMPS and the results were presented in the paper. The experimental results show that the new algorithm effectively relieves the disadvantages of ACOA and NN in RCMPS.

  • On the NP-hardness of solving bilinear matrix inequalities and simultaneous stabilization with static output feedback

    In this paper, it is shown that the problem of checking the solvability of a bilinear matrix inequality (BMI), is NP-hard. A matrix valued function, F(X,Y), is called bilinear if it is linear with respect to each of its arguments, and an inequality of the form, F(X,Y)>0 is called a bilinear matrix inequality. Recently, it was shown that, the static output feedback problem, fixed order controller problem, reduced order H/sup /spl infin// controller design problem, and several other control problems can be formulated as BMIs. The main result of this paper shows that the problem of checking the solvability of BMIs is NP-hard, and hence it is rather unlikely to find a polynomial time algorithm for solving general BMI problems. As an independent result, it is also shown that simultaneous stabilization with static output feedback is an NP-hard problem, namely for given n plants, the problem of checking the existence of a static gain matrix, which stabilizes all of the n plants, is NP-hard.

  • ClustalY: speed up the guide tree building for ClustalW

    Since finding an optimal multiple sequences alignment is a NP-hard problem, various heuristic approaches have been proposed. The popular sequence alignment program ClustalW uses the progressive alignment. This approach works by aligning sequences using a series of pairwise alignments with a guide tree. A pairwise distance matrix is calculated to construct the guide tree to show the evolutionary relationship of the sequences. We use a faster algorithm to replace the two algorithms come with the current ClustalW to calculate the distance matrix. Experimental results show that speedup of over 10 is obtainable for the guide tree building stage with acceptable little loss of accuracy



Standards related to NP-hard problem

Back to Top

No standards are currently tagged "NP-hard problem"


Jobs related to NP-hard problem

Back to Top