نتایج جستجو برای: covering techniques

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

Journal: :J. Comb. Theory, Ser. B 2005
Shlomo Hoory

For a finite connected graph let be the spectral radius of its universal cover. We prove that for any graph of average degree and derive from it the following generalization of the Alon Boppana bound. If the average degree of the graph after deleting any radius ball is at least , then its second largest eigenvalue in absolute value is at least for some absolute constant . This result is tight i...

2016
JAMES F. DAVIS

The main theorem states that if K is a finite CW-complex with finite fundamental group G and universal cover homotopy equivalent to a product of spheres X, then G acts smoothly and freely on X×Sn for any n greater than or equal to the dimension of X. If the G-action on the universal cover of K is homologically trivial, then so is the action on X × Sn. Ünlü and Yalçın recently showed that any fi...

Journal: :Journal of Combinatorial Theory, Series A 1998

2000
Vasco M. Manquinho Joao Marques-Silva

This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Computer Science and Engineering. In Artificial Intelligence, BCP can be used for computing minimum-size prime implicants of Boolean functions, of interest in Automated Reasoning and Non-Monotonic Reasoning. Binate Coverin...

2013
Charles J. Colbourn Jose Torres-Jimenez

ARTICLE INFO Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation...

Journal: :international journal of industrial engineering and productional research- 0
yahia zare mehrjerdi department of industrial engineering, yazd university yazd iran amir ebrahimi zade hassan hosseininasab department of industrial engineering, yazd university yazd iran

abstract one of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. change in problem parameters during the pl...

پایان نامه :0 1374

the present study investigated the effect of the two vocabulary teaching techniques in est, namely the use of translation and the use of visual aids as two separate vocabulary teaching techniques. to answer the question of the study, a pretest (michigan test) was administered to the 58 randomly selected est students at khajeh nasiredin tusi university, faculty of mechanics. after the homogeneit...

Journal: :IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2002

Journal: :European Journal of Combinatorics 1991

Journal: :Electr. J. Comb. 2015
André G. Castoldi Emerson L. Monte Carmelo

We investigate the covering problem in RT spaces induced by the RosenbloomTsfasman metric, extending the classical covering problem in Hamming spaces. Some connections between coverings in RT spaces and coverings in Hamming spaces are derived. Several lower and upper bounds are established for the smallest cardinality of a covering code in an RT space, generalizing results by Carnielli, Chen an...

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

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