Catalogo Articoli (Spogli Riviste)

HELP
ATTENZIONE: attualmente gli articoli Current Contents (fonte ISI) a partire dall'anno 2002 sono consultabili sulla Risorsa On-Line

Le informazioni sugli articoli di fonte ISI sono coperte da copyright

La ricerca find articoli where soggetti phrase all words 'CASE COMPLEXITY' sort by level,fasc_key/DESCEND, pagina_ini_num/ASCEND ha restituito 50 riferimenti
Selezionare un intervallo

Per ulteriori informazioni selezionare i riferimenti di interesse.

    1. Aida, S; Tsukiji, T
      P-comp versus P-samp questions on average polynomial domination

      IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
    2. de Jonge, P; Huyse, FJ; Herzog, T; Lobo, A; Malt, U; Opmeer, BC; Kuiper, B; Krabbendam, A
      Referral pattern of neurological patients to psychiatric Consultation-Liaison Services in 33 European hospitals

      GENERAL HOSPITAL PSYCHIATRY
    3. de Jonge, P; Huyse, FJ; Stiefel, FC; Slaets, JPJ; Gans, ROB
      INTERMED - A clinical instrument for biopsychosocial assessment

      PSYCHOSOMATICS
    4. Bahmann, H; Schatte, P
      Analysis of some elementary algorithms for prime factorization

      COMPUTING
    5. Koch, N; Stiefel, F; De Jonge, P; Fransen, J; Chamot, AM; Gerster, JC; Huyse, F; So, AKL
      Identification of case complexity and increased health care utilization inpatients with rheumatoid arthritis

      ARTHRITIS & RHEUMATISM-ARTHRITIS CARE & RESEARCH
    6. Fischer, CJ; Stiefel, FC; De Jonge, P; Guex, P; Troendle, A; Bulliard, C; Huyse, FJ; Gaillard, R; Ruiz, J
      Case complexity and clinical outcome in diabetes mellitus - A prospective study using the INTERMED

      DIABETES & METABOLISM
    7. Sitharam, M; Straney, T
      Sampling Boolean functions over Abelian groups and applications

      APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING
    8. Lemaire, C; Moreau, JM
      A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case

      COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS
    9. Mazzocato, C; Stiefel, F; de Jonge, P; Levorato, A; Ducret, S; Huyse, FJ
      Comprehensive assessment of patients in palliative care: A descriptive study utilizing the INTERMED

      JOURNAL OF PAIN AND SYMPTOM MANAGEMENT
    10. Pavan, A; Selman, AL
      Complete distributional problems, hard languages, and resource-bounded measure

      THEORETICAL COMPUTER SCIENCE
    11. Plaskota, L; Wasilkowski, GW; Wozniakowski, H
      A new algorithm and worst case complexity for Feynman-Kac path integration

      JOURNAL OF COMPUTATIONAL PHYSICS
    12. Datta, A; Soundaralakshmi, S
      An efficient algorithm for computing the maximum empty rectangle in three dimensions

      INFORMATION SCIENCES
    13. Jiang, T; Li, M; Vitanyi, P
      A lower bound on the average-case complexity of shellsort

      JOURNAL OF THE ACM
    14. Yamakami, T
      Polynomial time samplable distributions

      JOURNAL OF COMPLEXITY
    15. van Hameren, A; Kleiss, R; Papadopoulos, CG
      Quantum field theory for discrepancies II: 1/N corrections using fermions

      NUCLEAR PHYSICS B
    16. Borgwardt, KH
      A sharp upper bound for the expected number of shadow vertices in LP-polyhedra under orthogonal projection on two-dimensional planes (vol 24, pg 544,1999)

      MATHEMATICS OF OPERATIONS RESEARCH
    17. Borgwardt, KH
      A sharp upper bound for the expected number of shadow vertices in LP-polyhedra under orthogonal projection on two-dimensional planes

      MATHEMATICS OF OPERATIONS RESEARCH
    18. Stiefel, FC; de Jonge, P; Huyse, FJ; Slaets, JPJ; Guex, P; Lyons, JS; Vannotti, M; Fritsch, C; Moeri, R; Leyvraz, PF; So, A; Spagnoli, J
      INTERMED - An assessment and classification system for case complexity - Results in patients with low back pain

      SPINE
    19. Belanger, J; Pavan, A; Wang, J
      Reductions do not preserve fast convergence rates in average time

      ALGORITHMICA
    20. Lang, SD
      An extended banker's algorithm for deadlock avoidance

      IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
    21. Wang, J
      Distributional word problem for groups

      SIAM JOURNAL ON COMPUTING
    22. Buhrman, H; Hoepman, JH; Vitanyi, P
      Space-efficient routing tables for almost all networks and the incompressibility method

      SIAM JOURNAL ON COMPUTING
    23. Hickernell, FJ; Hong, HS
      The asymptotic efficiency of randomized nets for quadrature

      MATHEMATICS OF COMPUTATION
    24. Jiang, TZ; Evans, DJ
      The worst case complexity of the Fredholm equation with periodic free termand noisy information

      INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
    25. Ferri, FJ; Vidal, E
      Case-studies on average-case analysis for an elementary course on algorithms

      IEEE TRANSACTIONS ON EDUCATION
    26. VANHAMEREN A; KLEISS R; HOOGLAND J
      GAUSSIAN LIMITS FOR DISCREPANCIES

      Nuclear physics. B, Proceedings supplement
    27. VANHAMEREN A; KLEISS R
      QUANTUM-FIELD THEORY FOR DISCREPANCIES

      Nuclear physics. B
    28. TYSZKIEWICZ J
      THE KOLMOGOROV EXPRESSIVE POWER OF BOOLEAN QUERY LANGUAGES

      Theoretical computer science
    29. SZALAY V
      CONTRACTED DISTRIBUTED APPROXIMATING FUNCTIONS - DERIVATION OF NONOSCILLATORY FREE PARTICLE AND HARMONIC PROPAGATORS FOR FEYNMAN PATH INTEGRATION IN REAL-TIME

      The Journal of chemical physics
    30. REISCHUK R; SCHINDELHAUER C
      AN AVERAGE COMPLEXITY MEASURE THAT YIELDS TIGHT HIERARCHIES

      Computational complexity
    31. BELANGER J; WANG J
      NO NP PROBLEMS AVERAGING OVER RANKING OF DISTRIBUTIONS ARE HARDER

      Theoretical computer science
    32. ZHANG WX
      A NOTE ON THE COMPLEXITY OF THE ASYMMETRIC TRAVELING SALESMAN PROBLEM

      Operations research letters
    33. CHEN ZL; POWELL WB
      A NOTE ON BERTSEKAS SMALL-LABEL-FIRST STRATEGY

      Networks
    34. AHLSWEDE R; CAI N; ZHANG Z
      ON INTERACTIVE COMMUNICATION

      IEEE transactions on information theory
    35. JAMES F; HOOGLAND J; KLEISS R
      MULTIDIMENSIONAL SAMPLING FOR SIMULATION AND INTEGRATION - MEASURES, DISCREPANCIES, AND QUASI-RANDOM NUMBERS

      Computer physics communications
    36. VANHAMEREN A; KLEISS R; HOOGLAND J
      GAUSSIAN LIMITS FOR DISCREPANCIES I - ASYMPTOTIC RESULTS

      Computer physics communications
    37. VANDERGAAG LC
      ON EVIDENCE ABSORPTION FOR BELIEF NETWORKS

      International journal of approximate reasoning
    38. LABHALLA S; LOMBARDI H; MARLIN R
      ALGORITHMS FOR COMPUTING THE HERMITE REDUCTION OF A POLYNOMIAL MATRIX

      Theoretical computer science
    39. RITTER K
      ASYMPTOTIC OPTIMALITY OF REGULAR SEQUENCE DESIGNS

      Annals of statistics
    40. RITTER K; WASILKOWSKI GW
      CUBATURE AND RECONSTRUCTION OF SMOOTH ISOTROPIC RANDOM FUNCTIONS

      Zeitschrift fur angewandte Mathematik und Mechanik
    41. WOZNIAKOWSKI H
      AN INTRODUCTION TO INFORMATION-BASED COMPLEXITY

      Zeitschrift fur angewandte Mathematik und Mechanik
    42. WOZNIAKOWSKI H
      COMPLEXITY OF MULTIVARIATE PROBLEMS WITH APPLICATIONS TO PATH-INTEGRALS

      Zeitschrift fur angewandte Mathematik und Mechanik
    43. WASILKOWSKI GW; WOZNIAKOWSKI H
      ON TRACTABILITY OF PATH INTEGRATION

      Journal of mathematical physics
    44. IRIGUCHI H; KOYAMA M; SHISHIBORI M; AOE J
      A FAST RETRIEVAL TECHNIQUE FOR LARGE GRAPH STRUCTURES

      International journal of computer mathematics
    45. HOOGLAND JK; KLEISS R
      DISCREPANCY-BASED ERROR-ESTIMATES FOR QUASI-MONTE CARLO .1. GENERAL FORMALISM

      Computer physics communications
    46. HOFFMAN DK; FRISHMAN A; KOURI DJ
      DISTRIBUTED APPROXIMATING FUNCTIONAL-APPROACH TO FITTING MULTIDIMENSIONAL SURFACES

      Chemical physics letters
    47. NOVAK E; RITTER K; WOZNIAKOWSKI H
      AVERAGE-CASE OPTIMALITY OF A HYBRID SECANT-BISECTION METHOD

      Mathematics of computation
    48. PUNNEN AP; NAIR KPK
      IMPROVED COMPLEXITY BOUND FOR THE MAXIMUM CARDINALITY BOTTLENECK BIPARTITE MATCHING PROBLEM

      Discrete applied mathematics
    49. BLASS A; GUREVICH Y
      RANDOMIZING REDUCTIONS OF SEARCH PROBLEMS

      SIAM journal on computing
    50. HAVAS G; HOLT DF; REES S
      RECOGNIZING BADLY PRESENTED Z-MODULES

      Linear algebra and its applications


ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 08/08/20 alle ore 18:26:42