A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
In addressing the new -- but still NP-complete -- problem of minimization of cover filters, this paper shows that multiple concepts previously believed to be true about combinatorial filters (and actually ... The class of combinatorial filters (discrete variants of widely-used probabilistic estimators) has been studied and methods for reducing their space requirements introduced. ... One class of objects where the problem of resource minimization can be clearly posed is in the case of combinatorial filters  . ...arXiv:2002.07153v3 fatcat:57pasj5mubehziotewffta75y4
But exact combinatorial filter reduction is an NP-complete problem and all current techniques are either inexact or formalized with exponentially many constraints. ... To leverage this observation, we introduce just-in-time generation of such constraints, which yields improvements in efficiency and has the potential to minimize large filters. ... Combinatorial filters and their minimization We firstly recall the notion of a combinatorial filter: Definition 1 (procrustean filter  ). ...arXiv:2011.03471v1 fatcat:mevttxoxq5dz5nmids2il6rtke
The problem of combinatorial filter reduction arises from questions of resource optimization in robots; it is one specific way in which automation can help to achieve minimalism, to build better, simpler ... The hardness separation for minimization which exists between deterministic filter and deterministic automata, thus, does not hold for the nondeterministic case. ... COMBINATORIAL FILTERS AND THEIR MINIMIZATION We first give our model of combinatorial filters: Definition 1 (procrustean filter  ). ...arXiv:2107.07111v1 fatcat:z6p2cidvivfitmj3cvn5fpfkue
By following the systematic mapping study guidelines, we have selected and filtered 44 primary studies for review. ... In CIT, one has to construct a covering array, which is a set of configurations having valid feature combinations and every combination of t features appears at least once in the array. ... /UPM for their invaluable comments and suggestions. ...doi:10.3844/jcssp.2016.379.398 fatcat:kdc2r5kkiveqho3ycwcdmmf77u
Mathematicians have been concerned with the NP-complete problem of finding minimal covering arrays (in other words, minimal CIT test suites) since early nineties. ... Combinatorial Interaction Testing (CIT) has gained a lot of attention in the area of software engineering in the last few years. CIT problems have their roots in combinatorics. ... In order to avoid running into this combinatorial explosion problem, Combinatorial Interaction Testing (CIT) techniques have been developed specifically for such systems. ...doi:10.1109/sbst.2015.11 dblp:conf/icse/Petke15 fatcat:rrbwyyxxxfbhtmix5oazlygfia
Active power filter placement and sizing could be regarded as an optimization problem. A few objective functions have been proposed for this problem. ... In this paper we compare solutions obtained by means of combinatorial and genetic approaches. The theoretical discussion is followed by examples of active power filter placement and sizing ... Acknowledgment This work was supported by the Polish Ministry of Science and Higher Education under the project no. N N510 257338. ...doi:10.1515/amcs-2015-0021 fatcat:pu73qfusnvajlnxuowwf73lsba
These combinatorial properties seem to be presently of interest only in connection with their application to non-saturation. A. ... This paper is devoted to developing combinatorial properties that imply that the closed unbounded filter on the successor A* of a singular cardinal A is not A**-saturated. ...
and scheduling problems arising in real-world applications. ... The main topics include sequencing and scheduling with additional constraints (setup times or costs, precedence constraints, resource constraints, and batch production environment) and production planning ... staff of the MDPI journal Algorithms for their assistance in managing the review process in a prompt manner and for their continuous support whenever needed. ...doi:10.3390/a11060087 fatcat:vcgn3mcf6vcudefhx3kvyyidiy
Results: Here we proposed to formulate the optimal combinatorial therapy problem into two complementary mathematical algorithms, Balanced Target Set Cover (BTSC) and Minimum Off-Target Set Cover (MOTSC ... Given a disease gene set, BTSC seeks a balanced solution that maximizes the coverage on the disease genes and minimizes the off-target hits at the same time. ... ACKNOWLEDGEMENTS The authors extend their gratitude to Drs Juan Botas, Huda Zoghbi and James Alverez. The authors also thank the reviewers for their valuable suggestions on improving the manuscript. ...doi:10.1093/bioinformatics/btu046 pmid:24463180 pmcid:PMC4016706 fatcat:fioilcepwzhd5oyi4t6sbv372a
The quadratic assignment problem (QAP) be appropriate to the group of NP-hard issues and is measured as a challenging problem of the combinatorial optimization. ... Those databases are regarded extensive adequate in covering QAP and the methods utilized in solving QAP. ... the facilities and other support for this study. ...doi:10.14419/ijet.v7i3.20.18722 fatcat:5b7dfvvdtfe7bgcypah74xtngm
Two goal functions have been used to solve the underlying optimization problem - the first one that enables direct cost minimization and the second one based on the cost-effectiveness approach used by ... Problems concerning electrical power quality and especially estimation of costs required for reduction of higher harmonics in power network voltage and current time waveforms have been considered in the ... Among papers on this topic, there are also publications closely related to the problem covered by this paper, i.e. optimization of compensator allocation in power systems. ...doi:10.1515/bpasts-2016-0005 fatcat:sxves477crcphfb5dqhokbv76y
The problem considered is a Bayesian optimization problem in which it is required to minimize an average risk. ... Given a fixed linear, time- invariant filter with weighting function g(n) and an ideal received process s(n)*q(n), the power-constrained optimum linear filtering or coding problem for an additive noise ...
The initialized test suite is optimized using cuckoo search (CS) along with combinatorial approach, and mutation testing is used to seed different faults to the software-under-test, as well as to filter ... The paper also shows the application of combinatorial optimization and CS to the software testing. ... Sahib" for his time and advice during the writing of the paper. It is also worth mentioning the IDSIA Institute and Swiss Excellence Scholarship for hosting and supporting this research. ...doi:10.1016/j.jestch.2015.11.006 fatcat:lsabgsyjvzbs5d3ehu4fb5qxdu
Let F,; and F) be two bounded convex sets in R?. The authors consider the problem of translating F; and F) in order to min- imize the area of their symmetric difference. ... Is- sues discussed include: combinatorial complexity of arrangements, multiple cells, incidences, cuttings, range searching, partitions, and Heilbron’s problem. ...
Lecture Notes in Computer Science
We apply our methodology to set covering problems, and evaluate the strength of MDD relaxations to relaxations based on linear programming. ... We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. ... In this paper, we examine the use of BDDs and MDDs as relaxations for combinatorial optimization problems. ...doi:10.1007/978-3-642-21311-3_5 fatcat:qugl7k7cqjbfpigkkdy5d3cgzi
« Previous Showing results 1 — 15 out of 19,239 results