Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("ALGORITHME RECHERCHE")

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 7762

  • Page / 311
Export

Selection :

  • and

A SIMPLE ALGORITHM FOR BUILDING THE 3-D CONVEX HULLJOHANSEN GH; GRAM C.1983; BIT (NORDISK TIDSKRIFT FOR INFORMATIONSBEHANDLING); ISSN 0006-3835; SWE; DA. 1983; VOL. 23; NO 2; PP. 146-160; BIBL. 5 REF.Article

A DEPTH FIRST SEARCH ALGORITHM TO GENERATE THE FAMILY OF MAXIMAL INDEPENDENT SETS OF A GRAPH LEXICOGRAPHICALLYLOUKAKIS E; TSOUROS C.1981; COMPUTING; ISSN 0010-485X; AUT; DA. 1981; VOL. 27; NO 4; PP. 349-366; ABS. GER; BIBL. 13 REF.Article

ALGORITHM FOR FINDING THE COMMON SPANNING TREES OF TWO GRAPHSGRIMBLEBY JB.1982; ELECTRONICS LETTERS; ISSN 0013-5194; GBR; DA. 1982; VOL. 18; NO 23; PP. 988-989; BIBL. 2 REF.Article

ROBUST LINEAR ALGORITHMS FOR CUTSETSROSEN BK.1982; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1982; VOL. 3; NO 3; PP. 205-217; BIBL. 14 REF.Article

CHARACTERIZATION AND ALGORITHMS OF CURVE MAP GRAPHSGAVRIL F; SCHOENHEIM J.1982; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1982; VOL. 4; NO 3; PP. 181-191; BIBL. 6 REF.Article

A CONVEX HULL ALGORITHM FOR PLANAR SIMPLE POLYGONSORLOWSKI M.1982; NRIMS TECH. REP., TWISK; ISSN 501689; ZAF; DA. 1982; NO 290; 18 P.; BIBL. 6 REF.Serial Issue

AN ALGORITHM FOR FINDING OPTIMUM PATH IN NETWORKSBHAT KVS.1982; J. FRANKLIN INST.; ISSN 0016-0032; USA; DA. 1982; VOL. 314; NO 5; PP. 328-332; BIBL. 5 REF.Article

ON BRACKTRACKING: A COMBINATORIAL DESCRIPTION OF THE ALGORITHM.FILLMORE JP; WILLIAMSON SG.1974; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1974; VOL. 3; NO 1; PP. 41-55; BIBL. 3 REF.Article

A NEW ALGORITHM TO FIND THE SHORTEST PATHS BETWEEN ALL PAIRS OF NODESGALLO G; PALLOTTINO S.1982; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1982; VOL. 4; NO 1; PP. 23-35; BIBL. 25 REF.Article

DETERMINING THE MOST VITAL LINK IN A FLOW NETWORKLUBORE SH; RATLIFF HD; SICILIA GT et al.1972; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1972; VOL. 18; NO 4; PP. 497-502; BIBL. 3 REF.Serial Issue

DETERMINING THE NUMBER OF INTERNAL STABILITY OF A GRAPHLOUKAKIS E; TSOUROS C.1982; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1982; VOL. 11; NO 3-4; PP. 207-220; BIBL. 23 REF.Article

A DEPTH-FIRST-SEARCH CHARACTERIZATION OF PLANARITYDE FRAYSSEIX H; ROSENSTIEHL P.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; VOL. 62; PP. 75-80; BIBL. 6 REF.Conference Paper

A SIMPLE ALGORITHM FOR FINDING A CYCLE OF LENGTH GREATER THAN THREE AND WITHOUT DIAGONALSTRUSZCZYNSKI M.1981; COMPUTING; ISSN 0010-485X; AUT; DA. 1981; VOL. 27; NO 1; PP. 89-91; ABS. GER; BIBL. 5 REF.Article

LINEAR EXPECTED-TIME ALGORITHMS FOR CONNECTIVITY PROBLEMSKARP RE.1980; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1980; VOL. 1; NO 4; PP. 374-393; BIBL. 14 REF.Article

A NONLINEAR LEAST SQUARES SEARCH ALGORITHM.WOLBERG JR; ISENBERG J.1975; COMPUTER METHODS APPL. MECH. ENGNG; NETHERL.; DA. 1975; VOL. 5; NO 1; PP. 1-9; BIBL. 11 REF.Article

THERE IS NO FAST METHOD FOR FINDING MONOCHROMATIC COMPLETE SUBGRAPHSBECK J.1983; JOURNAL OF COMBINATORIAL THEORY. SERIES B; ISSN 0095-8956; USA; DA. 1983; VOL. 34; NO 1; PP. 58-64; BIBL. 3 REF.Article

AN EFFICIENT HEURISTIC FOR IDENTIFYING A MAXIMUM WEIGHT PLANAR SUBGRAPHEADES P; FOULDS L; GIFFIN J et al.1982; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1982; NO 952; PP. 239-251; BIBL. 16 REF.Conference Paper

THE CLIQUE PROBLEM FOR PLANAR GRAPHSPAPADIMITRIOU CH; YANNAKAKIS M.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 4-5; PP. 131-133; BIBL. 4 REF.Article

COMPLEXITY OF FINDING K-PATH-FREE DOMINATING SETS IN GRAPHSBAR YEHUDA R; VISHKIN U.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 5; PP. 228-232; BIBL. 8 REF.Article

NONPOLYNOMIAL AND INVERSE INTERPOLATION FOR LINE SEARCH: SYNTHESIS AND CONVERGENCE RATESBARZILAI J; BEN TAL A.1982; SIAM J. NUMER. ANAL.; ISSN 0036-1429; USA; DA. 1982; VOL. 19; NO 6; PP. 1263-1277; BIBL. 20 REF.Article

THE CONCEPT OF TWO-CHORD TIESETS AND ITS APPLICATION TO AN ALGEBRAIC CHARACTERIZATION OF NON-SERIES-PARALLEL GRAPHSSHINODA S; WAI KAI CHEN; SHU PARK CHAN et al.1982; SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 4; NO 2; PP. 244-252; BIBL. 4 REF.Article

STUDIES IN SEMI-ADMISSIBLE HEURISTICSPEARL J; KIM JH.1982; IEEE TRANS. PATTERN ANAL. MACH. INTELL.; ISSN 0162-8828; USA; DA. 1982; VOL. 4; NO 4; PP. 392-399; BIBL. 13 REF.Article

AN O(NLOG2N) ALGORITHM FOR THE KTH LONGEST PATH IN A TREE WITH APPLICATIONS TO LOCATION PROBLEMSMEGIDDO N; TAMIR A; ZEMEL E et al.1981; SIAM J. COMPUTING; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 2; PP. 328-337; BIBL. 15 REF.Article

NEAR ADMISSIBLE HEURISTIC SEARCH ALGORITHMSGHALLAB M; ALLARD D.1982; WORLD CONFERENCE ON MATHEMATICS AT THE SERVICE OF MAN. 2/1982-06-28/LAS PALMAS; ESP; DA. 1982; PP. 293-298; BIBL. 8 REF.Conference Paper

A FAST ALGORITHM FOR FINDING ALL SHORTEST PATHSWATANABE O.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 1; PP. 1-3; BIBL. 4 REF.Article

  • Page / 311