103,419 Hits in 5.7 sec

Counting Problems and Clones of Functions

Andrei A. Bulatov
2009 2009 39th International Symposium on Multiple-Valued Logic  
The central motif of this survey is the connection between the complexity of counting CSPs and clones of functions of multi-valued logic and co-clones of relations.  ...  In other cases, such as approximate counting, the connection is weaker, allows one to employ only partial functions and co-clones of the corresponding type. In those cases many problems remain open.  ...  Due to the Galois connection between sets of relations and sets of partial clones, partial functions are in control of the approximation complexity of counting problems.  ... 
doi:10.1109/ismvl.2009.47 dblp:conf/ismvl/Bulatov09 fatcat:4xtyqeumsvbr3lcnfu4ukzfrsy

The number of clone orderings

Lee Aaron Newberg
1996 Discrete Applied Mathematics  
This article provides an exponential generating function and a recurrence relation for computing the number of topologically distinct clone orderings.  ...  Denote the number of maps for n clones by c(n) and define the exponential generating function C(x) = 5 c(n);. n=O We show c(1) = 1, c(2) = 2, c(3) = 10, and, for n > 3, that c(n) = (4n-S)c(n-l)-(4n-7)  ...  Acknowledgements Many thanks to Terry Speed, Farid Alizadeh, Dick Karp, Diane Hemek, David Blackston, Heidi Newberg, and the anonymous referees for questions and suggestions.  ... 
doi:10.1016/0166-218x(96)00093-5 fatcat:2ykdlb4b4rgljhubtgk32wvtuu

Log-supermodular functions, functional clones and counting CSPs

Andrei A. Bulatov, Martin Dyer, Leslie Ann Goldberg, Mark Jerrum, Marc Herbstritt
2012 Symposium on Theoretical Aspects of Computer Science  
Motivated by a desire to understand the computational complexity of counting constraint satisfaction problems (counting CSPs), particularly the complexity of approximation, we study functional clones of  ...  Given this, we prove that there are no functional clones lying strictly between the clone of lsm functions and the total clone (containing all functions).  ...  If there is a complex landscape of functional clones it must lie between the functional clone generated by IMP and the class of functions LSM.  ... 
doi:10.4230/lipics.stacs.2012.302 dblp:conf/stacs/BulatovDGJ12 fatcat:dnxaahqkpjbyzpwgwqxtclpuxq

Clone-based Data Index in Cloud Storage Systems

Jing He, Yue Wu, Yang Fu, Wei Zhou, J.C.M. Kao, W.-P. Sung
2016 MATEC Web of Conferences  
Then, a clone based B+ tree structure is proposed to achieve high performance and adapt dynamic environment. The experimental results show that our clone-based solution has high efficiency.  ...  To solve these problems, we propose a double-layer index structure that overcomes the throughput limitation of single point server.  ...  Acknowledgement This work is supported by the National Natural Science Foundation of China (61363021); Science Research Fund of Yunnan Provincial Education Department (2014Y013);  ... 
doi:10.1051/matecconf/20166305004 fatcat:2ufr7pichbhdhlexhlkvoalkbm

On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata [chapter]

Predrag T. Tošić, Gul A. Agha
2005 Lecture Notes in Computer Science  
We also show that the problems of counting exactly the garden of Eden configurations (GEs), as well as all transient configurations, are in general intractable, as well.  ...  We prove that both exact and approximate counting of FPs in Sequential and Synchronous Dynamical Systems (SDSs and SyDSs, respectively) are computationally intractable, even when each node is required  ...  Acknowledgments: The first author expresses his sincere gratitude to Harry Hunt (SUNY-Albany), Michael Loui (University of Illinois) and Madhav Marathe (Los Alamos National Laboratory) for many useful  ... 
doi:10.1007/11560319_18 fatcat:63njogc4orabzk6432yrakdp4a

SVM Parameter Optimization Based on Immune Memory Clone Strategy and Application in Bus Passenger Flow Counting

Fang Zhu, Jun Fang Wei
2012 Advanced Engineering Forum  
According to the above deficiency, this paper proposed a parameters optimization method of support vector machine based on immune memory clone strategy (IMC).  ...  This method can solve the multi-peak model parameters selection problem better which is introduced by n-folded cross-verification.  ...  This method solves the problem that low cost device can't count the number of passengers accurately and can't distinguish the direction of passengers' movement.  ... 
doi:10.4028/ fatcat:ptg3vui3qzhcxf5uekfz5fhdje

Boreas: an accurate and scalable token-based approach to code clone detection

Yang Yuan, Yao Guo
2012 Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering - ASE 2012  
Boreas introduces a novel counting-based method to define the characteristic matrices, which are able to describe the program segments distinctly and effectively for the purpose of clone detection.  ...  Detecting code clones in a program has many applications in software engineering and other related fields.  ...  If these code clones could be efficiently and accurately detected, the problems they brought might be easily solved or at least properly controlled.  ... 
doi:10.1145/2351676.2351725 dblp:conf/kbse/YuanG12 fatcat:egu7nmybzbakpejzpvpcgd5h4q

Galois correspondence for counting quantifiers [article]

Andrei A. Bulatov, Amir Hedayaty
2012 arXiv   pre-print
Then we show that approximation preserving reductions between counting constraint satisfaction problems (#CSPs) are preserved by these two types of closure operators.  ...  We characterize partial clones of relations closed under k-existential quantification as sets of relations invariant under a set of partial functions that satisfy the condition of k-subset surjectivity  ...  The problem of counting the number of satisfying assignments to a CNF, #SAT , is predictably the most difficult problem among counting CSPs.  ... 
arXiv:1210.3344v1 fatcat:bli7tjoyivcmhidf2e3yt7icum

WCET-driven, code-size critical procedure cloning

Paul Lokuciejewski, Heiko Falk, Peter Marwedel, Henrik Theiling
2008 Proceedings of the 11th international workshop on Software & compilers for embedded systems - SCOPES '08  
Second Step: WCET and Code Size collection Successive evaluation of functions on WC path Clone functions iff its parameter is used Inside a loop statement OR Inside a conditional expression OR  ...  Lokuciejewski et al., Influence of Procedure Cloning on WCET Prediction, ISSS 2007] Introduction Motivating examples Standard Procedure Cloning Problems WCET-Driven Procedure Cloning Algorithm  ... 
doi:10.1145/1361096.1361100 dblp:conf/scopes/LokuciejewskiFMT08 fatcat:ucci4ydxkrbzlk27t5iyblbv7m

Parameterized Complexity of Weighted Satisfiability Problems [chapter]

Nadia Creignou, Heribert Vollmer
2012 Lecture Notes in Computer Science  
We study the parameterized complexity of these problems and initiate a systematic study of the complexity of its fragments.  ...  Only the monotone fragment has been considered so far and proven to be of same complexity as the unrestricted problems.  ...  We are grateful to Arne Meier (Hannover) and Steffen Reith (Wiesbaden) for helpful discussions.  ... 
doi:10.1007/978-3-642-31612-8_26 fatcat:ortvpheqpnfuriule3ocg7ihny

Complexity Classifications for Propositional Abduction in Post's Framework [article]

Nadia Creignou, Johannes Schmidt, Michael Thomas
2010 arXiv   pre-print
Further, we address the problem of counting the explanations and draw a complete picture for the counting complexity.  ...  We consider different variants of the abduction problem in restricting both the manifestations and the hypotheses.  ...  Further, we address the problem of counting the explanations and draw a complete picture for the counting complexity.  ... 
arXiv:1006.4923v1 fatcat:ugxk57aoibe6jc6n3hikahbscu

The expressibility of functions on the boolean domain, with applications to counting CSPs

Andrei A. Bulatov, Martin Dyer, Leslie Ann Goldberg, Mark Jerrum, Colin Mcquillan
2013 Journal of the ACM  
Motivated by a desire to understand the computational complexity of (weighted) counting CSPs, we develop an analogous notion of functional clones and study the landscape of these clones.  ...  In the conservative case (where all nonnegative unary functions are available), we show that there are no functional clones lying strictly between the clone of lsm functions and the total clone (containing  ...  The complexity class #RHΠ 1 of counting problems was introduced by Dyer, Goldberg, Greenhill and Jerrum [2010] as a means to classify a wide class of approximate counting problems that were previously  ... 
doi:10.1145/2528401 fatcat:5kodphtjxjcobgginnygpcl7py

Use of Support Vector Machines and Artificial Neural Network Methods in Variety Improvement Studies: Potato Example

Mehmet Metin Özgüven
2018 Current Investigations in Agriculture and Current Research  
were created by using two attributes (eyes depth and eyes pit depth) of each clone in order to identify the clones to be eliminated.  ...  In order to identify the clones to be selected, two different models were created by using three attributes (tuber yield, number of tubers and average tuber weight) for each clone, and two different models  ...  Acknowledgment In this research, some of the data from the TUBITAK-TOVAG 113O928 project were used.  ... 
doi:10.32474/ciacr.2018.06.000229 fatcat:wldmu76syfbu3d32chciow2aoy

Complexity of logic-based argumentation in Post's framework

Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran
2011 Argument & Computation  
of Boolean functions.  ...  Finally, we give a classification also in terms of counting complexity.  ...  We note that the complexity of the corresponding fragments remained unclassified also for circumscription and positive abduction.  ... 
doi:10.1080/19462166.2011.629736 fatcat:qyuhd4ep3nc2niopdfpi366jk4

A formal semantics for feature cardinalities in feature diagrams

Raphael Michel, Andreas Classen, Arnaud Hubaux, Quentin Boucher
2011 Proceedings of the 5th Workshop on Variability Modeling of Software-Intensive Systems - VaMoS '11  
Other authors already investigated the problem and published different proposals of semantics for this construct.  ...  Feature cardinalities in feature diagrams determine the number of times a feature and its subtree can be duplicated during configuration by an operation named "cloning".  ...  In this case, on schema (c), C and D count together for two features and thus prevent any addition of a clone of E under any of the two clones of B.  ... 
doi:10.1145/1944892.1944902 dblp:conf/vamos/MichelCHB11 fatcat:4izjtykqljfjdo4omxi4dls64u
« Previous Showing results 1 — 15 out of 103,419 results