Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Algoritmo glotón")

Filter

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

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 1851

  • Page / 75
Export

Selection :

  • and

A greedy, graph-based algorithm for the alignment of multiple homologous gene listsFOSTIER, Jan; PROOST, Sebastian; DHOEDT, Bart et al.Bioinformatics (Oxford. Print). 2011, Vol 27, Num 6, pp 749-756, issn 1367-4803, 8 p.Article

Robustness of Greedy Type Minimum Evolution AlgorithmsSHIGEZUMI, Takeya.Lecture notes in computer science. 2006, pp 815-821, issn 0302-9743, isbn 3-540-34379-2, 7 p.Conference Paper

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

On the sequentiality of the successor functionFROUGNY, C.Information and computation (Print). 1997, Vol 139, Num 1, pp 17-38, issn 0890-5401Article

On incremental computation of transitive closure and greedy alignmentABDEDDAÏM, S.Lecture notes in computer science. 1997, pp 167-179, issn 0302-9743, isbn 3-540-63220-4Conference Paper

Greedy-like algorithms in modal Kleene algebraMÖLLER, Bernhard; STRUTH, Georg.Lecture notes in computer science. 2004, pp 202-214, issn 0302-9743, isbn 3-540-22145-X, 13 p.Conference Paper

Greedy algorithm and m-term trigonometric approximationTEMLYAKOV, V. N.Constructive approximation. 1998, Vol 14, Num 4, pp 569-587, issn 0176-4276Article

Greedy sets and related problemsGIRLICH, E; KOVALEV, M. M; VASILKOV, D. M et al.European journal of operational research. 1997, Vol 101, Num 1, pp 74-80, issn 0377-2217Article

Quasi-greedy triangulations approximating the minimum weight triangulationLEVCOPOULOS, C; KRZNARIC, D.Journal of algorithms (Print). 1998, Vol 27, Num 2, pp 303-338, issn 0196-6774Conference Paper

Using viruses to improve GAsPAPPALARDO, Francesco.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28323-4, 3Vol, Part 3, 161-170Conference Paper

Guarantees for the success frequency of an algorithm for finding dodgson-election winnersHOMAN, Christopher M; HEMASPAANDRA, Lane A.Lecture notes in computer science. 2006, pp 528-539, issn 0302-9743, isbn 3-540-37791-3, 1Vol, 12 p.Conference Paper

A tight analysis of the greedy algorithm for set coverSLAVIK, P.Journal of algorithms (Print). 1997, Vol 25, Num 2, pp 237-254, issn 0196-6774Article

New results on the k-Truck ProblemWEIMIN MA; YINFENG XU; YOU, Jane et al.Lecture notes in computer science. 2002, pp 504-513, issn 0302-9743, isbn 3-540-43996-X, 10 p.Conference Paper

Improved performance of the greedy algorithm for partial coverSLAVIK, P.Information processing letters. 1997, Vol 64, Num 5, pp 251-254, issn 0020-0190Article

On partial tests and partial reducts for decision tablesMOSHKOV, Mikhail Ju; PILISZCZUK, Marcin.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28653-5, 2Vol, Part I, 149-155Conference Paper

Scheduling in synchronous networks and the greedy algorithmLUI, K.-S; ZAKS, S.Theoretical computer science. 1999, Vol 220, Num 1, pp 157-183, issn 0304-3975Article

The scheduling of maintenance serviceANILY, S; GLASS, C. A; HASSIN, R et al.Discrete applied mathematics. 1998, Vol 82, Num 1-3, pp 27-42, issn 0166-218XArticle

Greedily approximating the r-independent set and k-center problems on random instancesKREUTER, B; NIERHOFF, T.Lecture notes in computer science. 1997, pp 43-53, issn 0302-9743, isbn 3-540-63248-4Conference Paper

On sequences without geometric progressionsBROWN, B. E; GORDON, D. M.Mathematics of computation. 1996, Vol 65, Num 216, pp 1749-1754, issn 0025-5718Article

LocOMP: algorithme localement orthogonal pour l'approximation parcimonieuse rapide de signaux longs sur des dictionnaires locaux = LocOMP : locally-orthogonal algorithm for rapid sparse approximation of long-range signals on local dictionariesMAILHE, Boris; GRIBONVAL, Rémi; BIMBOT, Frédéric et al.Colloque sur le traitement du signal et des images. 2009, 1Vol, p. 71Conference Paper

Counting and enumerating pointed pseudotriangulations with the greedy flip algorithmBRÖNNIMANN, Hervé; KETTNER, Lutz; POCCHIOLA, Michel et al.SIAM journal on computing (Print). 2007, Vol 36, Num 3, pp 721-739, issn 0097-5397, 19 p.Article

Characterizations of polygreedoids and poly-antimatroids by greedy algorithmsNAKAMURA, Masataka.Operations research letters. 2005, Vol 33, Num 4, pp 389-394, issn 0167-6377, 6 p.Article

Matroid representation of clique complexesKASHIWABARA, Kenji; OKAMOTO, Yoshio; UNO, Takeaki et al.Lecture notes in computer science. 2003, pp 192-201, issn 0302-9743, isbn 3-540-40534-8, 10 p.Conference Paper

Evaluating the local ratio algorithm for dynamic storage allocationPRUHS, Kirk; WIEWIORA, Eric.Lecture notes in computer science. 2002, pp 60-70, issn 0302-9743, isbn 3-540-43977-3, 11 p.Conference Paper

Linear time approximation scheme for the multiprocessor open shop problemSEVASTIANOV, S. V; WOEGINGER, G. J.Discrete applied mathematics. 2001, Vol 114, Num 1-3, pp 273-288, issn 0166-218XArticle

  • Page / 75