Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Cubierta conjunto")

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 559

  • Page / 23
Export

Selection :

  • and

On the approximability of the minimum test collection problemHALLDORSSON, Bjarni V; HALLDORSSON, Magnus M; RAVI, R et al.Lecture notes in computer science. 2001, pp 158-169, issn 0302-9743, isbn 3-540-42493-8Conference Paper

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

Rough approximation operators in covering approximation spacesLI, Tong-Jun.Lecture notes in computer science. 2006, pp 174-182, issn 0302-9743, isbn 3-540-47693-8, 1Vol, 9 p.Conference Paper

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

On construction of the set of irreducible partial coversMOSHKOV, Mikhail Ju.Lecture notes in computer science. 2005, pp 38-44, issn 0302-9743, isbn 3-540-29498-8, 1Vol, 7 p.Conference Paper

On the minimal covering of infinite setsKLIMO, J.Discrete applied mathematics. 1993, Vol 45, Num 2, pp 161-168, issn 0166-218XArticle

On the computation of colored domino tilings of simple and non-simple orthogonal polygonsWORMAN, Chris; BOTING YANG.Lecture notes in computer science. 2005, pp 859-868, issn 0302-9743, isbn 3-540-30935-7, 1Vol, 10 p.Conference Paper

Borsuk covering and planar sets with unique completionKOLODZIEJCZYK, K.Discrete mathematics. 1993, Vol 122, Num 1-3, pp 235-244, issn 0012-365XArticle

Information retrieval with commonsense knowledgeHSU, Ming-Hung; CHEN, Hsin-Hsi.International ACM SIGIR conference on research and development in information retrieval. 2006, pp 651-652, isbn 1-59593-369-7, 1Vol, 2 p.Conference Paper

Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear timeKUTZ, Martin.SCG : symposium on computational geometry. 2006, pp 430-438, isbn 1-59593-340-9, 1Vol, 9 p.Conference Paper

Covering properties of simplexesIDZIK, A; TAN, K.-K.Journal of mathematical analysis and applications. 1993, Vol 176, Num 2, pp 608-616, issn 0022-247XArticle

An approximation algorithm for the minimum latency set cover problemHASSIN, Refael; LEVIN, Asaf.Lecture notes in computer science. 2005, pp 726-733, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 8 p.Conference Paper

Conditions quantitatives de rectifiabilité = Quantitative conditions of rectifiabilityPAJOT, H.Bulletin de la Société Mathématique de France. 1997, Vol 125, Num 1, pp 15-53, issn 0037-9484Article

An optimization of the Besicovitch coveringLOEB, P. A.Proceedings of the American Mathematical Society. 1993, Vol 118, Num 3, pp 715-716, issn 0002-9939Article

Sur les recouvrements forts par des pseudo-boules = Strong coverings by pseudo-ballsASSOUAD, P; QUENTIN DE GROMARD, T.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1993, Vol 317, Num 5, pp 461-464, issn 0764-4442Article

Tight Approximation Algorithm for Connectivity Augmentation ProblemsKORTSARZ, Guy; NUTOV, Zeev.Lecture notes in computer science. 2006, pp 443-452, issn 0302-9743, isbn 3-540-35904-4, 10 p.Conference Paper

An approximation algorithm for alignment of multiple sequences using motif discoveryPARIDA, L; FLORATOS, A; RIGOUTSOS, I et al.Journal of combinatorial optimization. 1999, Vol 3, Num 2-3, pp 247-275, issn 1382-6905Article

Computing envelopes in four dimensions with applicationsAGARWAL, P. K; ARONOV, B; SHARIR, M et al.SIAM journal on computing (Print). 1997, Vol 26, Num 6, pp 1714-1732, issn 0097-5397Article

Rareté des intervalles recouvrant un point dans un recouvrement aléatoire = Scarcity of point covering intervals in random coverageAI HUA FAN; KAHANE, J.-P.Annales de l'I.H.P. Probabilités et statistiques. 1993, Vol 29, Num 3, pp 453-466, issn 0246-0203Article

A better-than-greedy approximation algorithm for the minimum set cover problemHASSIN, Refael; LEVIN, Asaf.SIAM journal on computing (Print). 2006, Vol 35, Num 1, pp 189-200, issn 0097-5397, 12 p.Article

HQC : An efficient method for ROLAP with hierarchical dimensionsDONG, Xing-Ye; HUANG, Hou-Kuan; LI, Hong-Song et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28653-5, 2Vol, Part II, 211-220Conference Paper

The equivalence of general set-covering and implicit integer programming formulations for shift schedulingBECHTOLD, S. E; JACOBS, L. W.Naval research logistics. 1996, Vol 43, Num 2, pp 233-249, issn 0894-069XArticle

Dérivation des mesures à l'aide de pseudo-boules = Derivation of measures by means of pseudo-ballsASSOUAD, P; QUENTIN DE GROMARD, T.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1995, Vol 320, Num 9, pp 1065-1068, issn 0764-4442Article

A heuristic algorithm for the multi-criteria set-covering problemsYI-HSIN LIU.Applied mathematics letters. 1993, Vol 6, Num 5, pp 21-23, issn 0893-9659Article

Closed measure zero setsBARTOSZYNSKI, T; SHELASH, S.Annals of pure and applied logic. 1992, Vol 58, Num 2, pp 93-110, issn 0168-0072Article

  • Page / 23