Serveur d'exploration sur l'Université de Trèves - Curation (Istex)

Index « AbsEn.i » - entrée « classes »
Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.
class < classes < classesn  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 37.
[0-20] [0 - 20][0 - 37][20-36][20-40]
Ident.Authors (with country if any)Title
000504 (1943) Ruth C. Jackson [États-Unis]“Short Time” Suggestions for Spanish Classes
000513 (1994) Nguyen V. Thoai [Allemagne]On the construction of test problems for concave minimization algorithms
000591 (1988) R. Horst [Allemagne] ; Ng V. Thoai [Viêt Nam]Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
000747 (2011) Anna Kasprzik [Allemagne]Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data
000772 (2010) Christophe Costa Florêncio [Belgique] ; Henning Fernau [Allemagne]Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG
000807 (1981) René Dirven [Allemagne]SOME TRENDS IN THE THEORY AND PRACTICE OF LISTENING COMPREHENSION
000912 (1988) Reiner Horst [Allemagne] ; Jakob De Vries [Allemagne] ; Nguyen V. Thoai [Viêt Nam]On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
000A03 (1993) Christoph Meinel [Allemagne] ; Stephan Waack [Allemagne]Separating complexity classes related to bounded alternating Ω-branching programs
000A29 (2006) James Trier [États-Unis]Teaching With Media and Popular Culture
000C18 (1998) Michael LangenbruchSurjectivity of Partial Differential Operators on Gevrey Classes and Extension of Regularity
000C67 (1995) Carsten Damm [Allemagne] ; Markus Holzer [Allemagne]Automata that take advice
000D13 (2005) Francis Rousseaux [France] ; Thomas BouazizCollecting or Classifying ?
000D46 (1987) R. Horst [Allemagne] ; Ng. V. Thoai [Viêt Nam] ; H. Tuy [Viêt Nam]Outer approximation by polyhedral convex sets
000E36 (1997) Klaus Jansen [Allemagne]Approximation results for the optimum cost chromatic partition problem
000E60 (1997) Martin Mundhenk [Allemagne] ; Judy Goldsmith [États-Unis] ; Eric Allender [États-Unis]The complexity of policy evaluation for finite-horizon partially-observable Markov decision processes
000F56 (1993) Hans L. Bodlaender [Pays-Bas] ; Klaus Jansen [Allemagne]On the complexity of scheduling incompatible jobs with unit-times
000F60 (1994) Carsten Damm [Allemagne] ; Markus Holzer [Allemagne]Inductive counting below logspace
000F74 (1993) Klaus Jansen [Allemagne] ; Petra Scheffler [Allemagne] ; Gerhard J. Woeginger [Autriche]Maximum covering with D cliques
000F98 (2012) A. A. Albanese [Italie] ; D. Jornet [Espagne] ; A. Oliaro [Italie]Wave front sets for ultradistribution solutions of linear partial differential operators with coefficients in non‐quasianalytic classes
001035 (2001) Fadi P. Deek [États-Unis] ; Ki-Wang Ho [États-Unis] ; Haider Ramadhan [Oman]A critical analysis and evaluation of Web-based environments for program development
001037 (2002) Blaise Genest [France] ; Anca Muscholl [France] ; Helmut Seidl [Allemagne] ; Marc Zeitoun [France]Infinite-State High-Level MSCs: Model-Checking and Realizability

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Curation
HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Curation/AbsEn.i -k "classes" 
HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Curation/AbsEn.i  \
                -Sk "classes" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd 

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    Istex
   |étape=   Curation
   |type=    indexItem
   |index=    AbsEn.i
   |clé=    classes
}}

Wicri

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024