Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Set covering")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 822

  • Page / 33
Export

Selection :

  • and

Variability orderings related to coverage problems on the circleHUFFER, F.Journal of applied probability. 1986, Vol 23, Num 1, pp 97-106, issn 0021-9002Article

Tilings whose members have finitely many neighborsBREEN, M.Israel Journal of Mathematics. 1985, Vol 52, Num 1-2, pp 140-146, issn 0021-2172Article

Mean and variance of vacancy for distribution of k-dimensional spheres within k-dimensional spaceHALL, P.Journal of applied probability. 1984, Vol 21, Num 4, pp 738-752, issn 0021-9002Article

Derivation, Lψ-bounded martingales and covering conditionsTALAGRAND, M.Transactions of the American Mathematical Society. 1986, Vol 293, Num 1, pp 257-291, issn 0002-9947Article

On the coverage of k-dimensional space by k-dimensional spheresHALL, P.Annals of probability. 1985, Vol 13, Num 3, pp 991-1002, issn 0091-1798Article

Packing of ellipses with continuously distributed areaTOTH, L. F.Discrete mathematics. 1986, Vol 60, pp 263-267, issn 0012-365XArticle

Sample analogs to multidimensional coverages with applications to predictionSHIE-SHIEN YANG.Journal of the American Statistical Association. 1984, Vol 79, Num 388, pp 804-806, issn 0162-1459Article

A note on a symmetrical set covering problem : The lottery problemJANS, Raf; DEGRAEVE, Zeger.European journal of operational research. 2008, Vol 186, Num 1, pp 104-110, issn 0377-2217, 7 p.Article

A note towards improved homeland defensePLASTRIA, F.Omega (Oxford). 2012, Vol 40, Num 2, pp 244-248, issn 0305-0483, 5 p.Article

Probing through the intersection of hyperplanesSETHI, A. P; MEHREZ, A.Operations research letters. 1989, Vol 8, Num 3, pp 165-170, issn 0167-6377, 6 p.Article

Toroidal tilings from de Bruijn-good cyclic sequencesCOCK, J. C.Discrete mathematics. 1988, Vol 70, Num 2, pp 209-210, issn 0012-365XArticle

Explicit construction of exponential sized families of k-independent setsALON, N.Discrete mathematics. 1986, Vol 58, Num 2, pp 191-193, issn 0012-365XArticle

A class of polynomially solvable set-covering problemsBERTOLAZZI, P; SASSANO, A.SIAM journal on discrete mathematics. 1988, Vol 1, Num 3, pp 306-316Article

On the impossibility of packing space with different cubesDAWSON, R. J. M.Journal of combinatorial theory. Series A. 1988, Vol 48, Num 2, pp 174-188, issn 0097-3165Article

Exact coverings of the integers by arithmetic progressionsSIMPSON, R. J.Discrete mathematics. 1986, Vol 59, Num 1-2, pp 181-190, issn 0012-365XArticle

The Lee association scheme; Etude du schéma d'association de Lee = Le schéma d'association de LeeSOLE, Patrick.Rapports de recherche - INRIA. 1986, Vol 591, issn 0249-6399, 12 p.Report

A characterization of graphical covers = Soit S une famille d'ensembles. Un recouvrement S est graphique si et seulement si: 1 S=eS; 2 mS≤S; et 3 S satisfait la condition de chaîne affinanteBEDNAREK, A. R; OSTEEN, R. E.Discrete mathematics. 1985, Vol 57, Num 1-2, pp 155-158, issn 0012-365XArticle

The communication complexity of approximate set packing and coveringNISAN, Noam.Lecture notes in computer science. 2002, pp 868-875, issn 0302-9743, isbn 3-540-43864-5, 8 p.Conference Paper

Random coverings of the circle by ARCS with restricted endpointsJANSON, S.Journal of applied probability. 1988, Vol 25, Num 1, pp 215-219, issn 0021-9002Article

Tiling complexity of small n-ominoes (N<10)RAWSTHORNE, D. A.Discrete mathematics. 1988, Vol 70, Num 1, pp 71-75, issn 0012-365XArticle

Induced restricted Ramsey theorems for spacesFRANKL, P; GRAHAM, R. L; RODL, V et al.Journal of combinatorial theory. Series A. 1987, Vol 44, Num 1, pp 120-128, issn 0097-3165Article

The number of small semispaces of a finite set of points in the planeALON, N; GYORI, E.Journal of combinatorial theory. Series A. 1986, Vol 41, Num 1, pp 154-157, issn 0097-3165Article

On the categorizing of simply separable relations in partial four-valued logicRENREN LIU; ZHIWEI GONG; FEN XU et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28323-4, 3Vol, Part 3, 1251-1256Conference Paper

A new method in order to determine the most significant members within a large sample, in problems of surface approximationBOZZINI, M; DE TISI, F; LENARDUZZI, L et al.SIAM journal on scientific and statistical computing. 1986, Vol 7, Num 1, pp 98-104, issn 0196-5204Article

Non-trivial intersecting familiesFRANKL, P; FUREDI, Z.Journal of combinatorial theory. Series A. 1986, Vol 41, Num 1, pp 150-153, issn 0097-3165Article

  • Page / 33