نتایج جستجو برای: restricted variation

تعداد نتایج: 410157  

1997
Romuald Debruyne

There is no need to show the importance of the ltering techniques to solve constraint satisfaction problems i.e. to nd values for problem variables subject to constraints that specify which combinations of values are consistent. They can be used during a preprocessing step to remove once and for all some local inconsistencies, or during the search to eeciently prune the search tree. Recently, i...

Journal: :Transactions of the American Mathematical Society 1984

2011
Raphaël Clifford Zvi Gotthilf Moshe Lewenstein Alexandru Popa

The shortest common superstring and the shortest common supersequence are two well studied problems having a wide range of applications. In this paper we consider both problems with resource constraints, denoted as the Restricted Common Superstring (shortly RCSstr) problem and the Restricted Common Supersequence (shortly RCSseq). In the RCSstr (RCSseq) problem we are given a set S of n strings,...

Journal: :Journal of Multivariate Analysis 2000

Journal: :Canadian Mathematical Bulletin 2016

Journal: :Physical Review D 2020

Journal: :Pacific Journal of Mathematics 2014

Journal: :Notre Dame Journal of Formal Logic 1961

Journal: :Journal of Public Economics 2013

Journal: :Semantics and Linguistic Theory 2015

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید