Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("METHODE CAS PIRE")

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 3152

  • Page / 127
Export

Selection :

  • and

VIELD MAXIMIZATION AND WORST-CASE DESIGN WITH ARBITRARY STATISTICAL DISTRIBUTIONSBRAYTON RK; DIRECTOR SW; HACHTEL GD et al.1980; I.E.E.E. TRANS. CIRCUITS SYST.; USA; DA. 1980; VOL. 27; NO 9; PP. 756-764; BIBL. 11 REF.Article

TRUE WORST-CASE ANALYSIS OF LINEAR ELECTRICAL CIRCUITS BY INTERVAL ARITHMETICSKELBOE S.1979; I.E.E.E. TRANS. CIRCUITS SYST.; USA; DA. 1979; VOL. 26; NO 10; PP. 874-879; BIBL. 11 REF.Article

CALCULATION METHOD TO OBTAIN WORST-CASE STATIC NOISE MARGINS OF LOGIC CIRCUITSLOHSTROH J.1980; ELECTRON. LETTERS; GBR; DA. 1980; VOL. 16; NO 8; PP. 273-274; BIBL. 4 REF.Article

WORST-CASE- UND STATISTISCHE TOLERANZANALYSE ELEKTRISCHER NETZWERKE. = ANALYSE DES TOLERANCES DES RESEAUX ELECTRIQUES PAR LA METHODE DU PIRE CAS ET PAR LA METHODE STATISTIQUESUITER D.1977; ARCH. ELECTRON. UBERTRAG.-TECH.; DTSCH.; DA. 1977; VOL. 31; NO 12; PP. 513-517; ABS. ANGL.; BIBL. 12 REF.Article

WORST-CASE TOLERANCE OPTIMIZATION OF ANTENNA SYSTEMSSCHJAER JACOBSEN H.1980; I.E.E.E. TRANS. ANTENNAS PROPAG.; USA; DA. 1980; VOL. 28; NO 2; PP. 247-250; BIBL. 13 REF.Article

AN INTERACTIVE LINEAR PROGRAMMING APPROACH TO MODEL PARAMETER FITTING AND WORST CASE CIRCUIT DESIGNHACHTEL GD; SCOTT TR; ZUG RP et al.1980; I.E.E.E. TRANS. CIRCUITS SYST.; USA; DA. 1980; VOL. 27; NO 10; PP. 871-881; BIBL. 24 REF.Article

THE POST-OFFICE PROBLEM AND RELATED QUESTIONSMAURER H.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 100; PP. 1-19; BIBL. 18 REF.Conference Paper

AN OPTIMAL WORST CASE ALGORITHM FOR REPORTING INTERSECTIONS OF RECTANGLESBENTLEY JL; WOOD D.1980; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1980; VOL. 29; NO 7; PP. 571-577; BIBL. 14 REF.Article

WORST-MONTH STATISTICS.CRANE RK; DEBRUNNER WE.1978; ELECTRON. LETTERS; G.B.; DA. 1978; VOL. 14; NO 2; PP. 38-40; BIBL. 4 REF.Article

NONPREEMPTIVE LP-SCHEDULING ON HOMOGENEOUS MULTIPROCESSOR SYSTEMSKUNDE M.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 1; PP. 151-173; BIBL. 17 REF.Article

OPTIMAL CENTERING, TOLERANCING, AND YIELD DETERMINATION VIA UPDATED APPROXIMATIONS AND CUTSBANDLER JW; ABDEL MALEK HL.1978; I.E.E.E. TRANS. CIRCUITS SYST.; USA; DA. 1978; VOL. 25; NO 10; PP. 853-871; BIBL. 19 REF.Article

BOUNDS ON THE SCHEDULING OF TYPED TASK SYSTEMSJAFFE JM.1980; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1980; VOL. 9; NO 3; PP. 541-551; BIBL. 18 REF.Article

WORST CASE ANALYSIS OF A CLASS OF SET COVERING HEURISTICSHO AC.1982; MATH. PROGRAM.; ISSN 0025-5610; NLD; DA. 1982; VOL. 23; NO 2; PP. 170-180; BIBL. 6 REF.Article

A MODIFIED OBJECTIVE FUNCTION AND A FAST ALGORITHM FOR DESIGN CENTERINGAGNEW D.1982; IEE PROC., G; ISSN 0143-7089; GBR; DA. 1982; VOL. 129; NO 4; PP. 110-114; BIBL. 12 REF.Article

A WORST-CASE ANALYSIS OF NEAREST NEIGHBOR SEARCHING BY PROJECTIONPAPADIMITRIOU CH; BENTLEY JL.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 470-482; BIBL. 13 REF.Conference Paper

TOLERANCE ASSIGNMENT IN LINEAR NETWORKS USING NONLINEAR PROGRAMMING = ASSIGNATION DE TOLERANCE DANS LES RESEAUX LINEAIRES UTILISANT LA PROGRAMMATION NON LINEAIREPINEL JF; ROBERTS KA.1972; I.E.E.E. TRANS. CIRCUIT THEORY; U.S.A.; DA. 1972; VOL. 19; NO 5; PP. 475-479; BIBL. 10 REF.Serial Issue

DERIVING STABILITY CRITERIA FOR NONLINEAR CIRCUITS WITH APPLICATION TO WORST-CASE NOISE MARGIN OF I2LSEEVINCK.1980; ELECTRON. LETT.; ISSN 0013-5194; GBR; DA. 1980; VOL. 16; NO 23; PP. 867-869; BIBL. 4 REF.Article

ON WORST CASE INTERFERENCE FOR M-ARY SIGNALING WITH CORRELATION RECEIVERSMORRIS JM.1982; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1982; VOL. 28; NO 1; PP. 74-83; BIBL. 20 REF.Article

BOUNDS ON SCHEDULES FOR INDEPENDENT TASKS WITH SIMILAR EXECUTION TIMESACHUGBUE JO; CHIN FY.1981; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1981; VOL. 28; NO 1; PP. 81-99; BIBL. 6 REF.Article

WORST-CASE COMPLEXITY BOUNDS FOR ALGORITHMS IN THE THEORY OF INTEGRAL QUADRATIC FORMSLAGARIAS JC.1980; J. ALGORITHMS; USA; DA. 1980; VOL. 1; NO 2; PP. 142-186; BIBL. 35 REF.Article

EXACT CALCULATION OF THE UNCERTAINTY ON THE INPUT REFLECTION COEFFICIENT OF ARBITRARY TWO PORTS DUE TO MISMATCHES AND ARTIBRARY REFERENCE PLANESTROMP H.1978; I.E.E.E. TRANS. MICROWAVE THEORY TECH.; USA; DA. 1978; VOL. 26; NO 12; PP. 973-978; BIBL. 6 REF.Article

EXPECTED LENGTH OF THE LONGEST PROBE SEQUENCE IN HASH CODE SEARCHINGGONNET GH.1981; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1981; VOL. 28; NO 2; PP. 289-304; BIBL. 16 REF.Article

ALGORITHMS FOR FINDING DIRECTED GRAPH ISOMORPHISM BY FINITE AUTOMATACHAO CHIH YANG; MAY CP.1980; INTERNATION. J. COMPUTER INFORM. SCI.; USA; DA. 1980; VOL. 9; NO 2; PP. 117-140; BIBL. 22 REF.Article

EFFECTS OF ENCODING OFFSET AND QUANTIZING INACCURACIES AT LOW DYNAMICS LEVELS IN P.C.M. MULTIPLEXESFRANCHI R; GOMBA E; MOLINARI A et al.1979; ALTA FREQ.; ITA; DA. 1979; VOL. 48; NO 11; PP. 656-665; BIBL. 3 REF.Article

Two-Tier Relaxed HeapsELMASRY, Amr; JENSEN, Claus; KATAJAINEN, Jyrki et al.Lecture notes in computer science. 2006, pp 308-317, issn 0302-9743, isbn 3-540-49694-7, 1Vol, 10 p.Conference Paper

  • Page / 127