Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Algorithme glouton")

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 2003

  • Page / 81
Export

Selection :

  • and

Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado-Edmonds theoremCONFORTI, M; CORNUEJOLS, G.Discrete applied mathematics. 1984, Vol 7, Num 3, pp 251-274, issn 0166-218XArticle

Structural properties of greedoidsKORTE, B; LOVASZ, L.Combinatorica (Print). 1983, Vol 3, Num 3-4, pp 359-374, issn 0209-9683Article

Greedoids and linear objective functionsKORTE, B; LOVASZ, L.SIAM journal on algebraic and discrete methods. 1984, Vol 5, Num 2, pp 229-238, issn 0196-5212Article

On structures of bisubmodular polyhedraANDO, K; FUJISHIGE, S.Mathematical programming. 1996, Vol 74, Num 3, pp 293-317, issn 0025-5610Article

Totally-balanced and greedy matricesHOFFMAN, A. J; KOLEN, A. W. J; SAKAROVITCH, M et al.SIAM journal on algebraic and discrete methods. 1985, Vol 6, Num 4, pp 721-730, issn 0196-5212Article

Aspects algorithmiques et combinatoires des ensembles ordonnés finis et infinisZaguia, Nejib; Pouzet, Maurice.1989, 196 p.Thesis

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

Small transversals in hypergraphsCHVATAL, V; MCDIARMID, C.Combinatorica (Print). 1992, Vol 12, Num 1, pp 19-26, issn 0209-9683Article

Définition et optimisation de l'interconnexion dans un processeur spécialisé à commande synchrone = Definition and optimisation of unit interconnection in dedicated synchronous processorCarriere, Cécile; Bocri, Fernand.1992, 163 p.Thesis

A Greedy algorithm for solving a class of convex programming problems and its connect on with polymatroid theoryMORTON, G; VON RANDOW, R; RINGWALD, K et al.Mathematical programming. 1985, Vol 32, Num 2, pp 238-241, issn 0025-5610Article

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

Δ-Matroids with the strong exchange conditionsWENZEL, W.Applied mathematics letters. 1993, Vol 6, Num 5, pp 67-70, issn 0893-9659Article

Nested optimal policies for set functions with applications to schedulingASSAD, A. A.Mathematics of operations research. 1985, Vol 10, Num 1, pp 82-99, issn 0364-765XArticle

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

Matroids on ordered stes and the greedy algorithnFAIGLE, U.North-Holland mathematics studies. 1984, Vol 95, pp 115-128, issn 0304-0208Article

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

Matchings and Δ-matroids with coefficientsKALHOFF, F; WENZEL, W.Advances in applied mathematics (Print). 1996, Vol 17, Num 1, pp 63-87, issn 0196-8858Article

Further results on T-coloring and frequency assignment problemsARUNDHATI RAYCHAUDHURI.SIAM journal on discrete mathematics (Print). 1994, Vol 7, Num 4, pp 605-613, issn 0895-4801Article

The partial order of a polymatroid extreme pointBIXBY, R. E; CUNNINGHAM, W. H; TOPKIS, D. M et al.Mathematics of operations research. 1985, Vol 10, Num 3, pp 367-378, issn 0364-765XArticle

ON THE GREEDY HEURISTIC FOR CONTINUOUS COVERING AND PACKING PROBLEMSFISHER ML; WOLSEY LA.1982; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 3; NO 4; PP. 584-591; BIBL. 10 REF.Conference Paper

  • Page / 81