The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Pairwise test set generation is the process of producing a subset of all possible test case inputs to a system in situations where exhaustive testing is not possible or is prohibitively expensive. For a given system under test with a set of input parameters where each parameter can take on one of a discrete set of values, a pairwise test set consists of a collection of vectors which capture all possible...
Tree automata turned out to be a very convenient framework for modeling and proving properties on infinite systems like communication protocols, Java programs and also in the context of XML programming. Unfortunately, these works are not always supported by efficient verification and validation tools. This paper investigates the use of two SAT solvers --- MiniSat and picoSat --- to evaluate queries...
Computing the multi-constrained least-cost multicast routing tree is an NP-complete problem. In order to solve the quality of service (QoS) constrained routing effectively and efficiently, the scheme of routing based on differential evolution (DE) is proposed. The individuals of the multicast tree which adopt path coding according to the characters of real coding of DE are optimized by mutation and...
The hitting-set problem is an NP-complete problem in set theory. Assume that we have collection C of subsets of a finite set S, and a positive integer K les |S|, and we would like to know if there is a subset S' sube S with |S'| les K such that S' hits (contains) at least one element from each subset in C. In this paper, the DNA-based algorithm is proposed to solve the hitting-set problem. Furthermore,...
Article describes a polynomial time many-one reduction of SAT to a polynomial size asymmetric linear system, where asymmetry means that shape and location of the system's polytope depend on order of clauses in CNF and on order of literals in the clauses.
Real-time task scheduling for multiprocessor systems is generally a NP-complete problem and thus genetic algorithms (GAs) are extensively used. However, since GAs aim to be one kind of universal algorithm across a variety of problem types, they hardly use problem-specific search techniques which might help speed up the search process or lead to a better solution under certain scenarios. That partly...
The advent of various real-time multimedia applications in high-speed networks creates a need for quality of service (QoS) based multicast routing. Two important QoS constraints are the bandwidth constraint and the end-to-end delay constraint. The QoS based multicast routing problem is a known NP-complete problem that depends on (1) bounded end-to-end delay and link bandwidth along the paths from...
Instead of executing a program at a centralized server system, is it possible to slice a program and run different slices dynamically across the Internet? This is exactly what this paper will examine and present. Concept of programmable nodes was introduced years ago. Commercially, active network concept was not feasible to operate in routers. But with the arrival of overlays, extension of programmable...
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possible to achieve with any structure from motion algorithm. Even though there are recent, promising attempts to compute globally optimal solutions, there is no hope of obtaining a polynomial time algorithm unless P=NP. The proof...
Summary form only given. This paper proposes some additional strategies to prefix data compression algorithms to achieve both compressed and ciphered data with the use of a provably secure algorithm. It was shown that the use of homophonic substitution increases the security of the ciphertext and that breaking HSPC2 (homophonic substitution prefix codes with 2 homophones) is an NP-complete problem
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.