problem < problems < procedural

Facettes :

List of bibliographic references

Number of relevant bibliographic references: 33.
[0-20] [0 - 20][0 - 33][20-32][20-40]

Ident.	Authors (with country if any)	Title
000197 (2011)	Andrea Sand	Hans-Georg Wolf & Frank Polzenhagen, World Englishes: A Cognitive Sociolinguistic Approach; World Englishes – Problems, Properties and Prospects. Selected Papers from the 13th IAWE Conference, ed. Thomas Hoffmann & Lucia Siebers
000535 (2008)	Helmut Finner [Allemagne]	Preface to the Translation of Eckart Sonnemann's 1982 Paper on General Solutions to Multiple Testing Problems
000562 (2008)	Michael Fellows [Australie] ; Henning Fernau [Australie, Allemagne]	Facility Location Problems: A Parameterized View
000585 (2008)	Wolfgang Bangerth [États-Unis] ; Amit Joshi [États-Unis]	Adaptive finite element methods for the solution of inverse problems in optical tomography
000600 (2007)	Gerben G. Meyer [Pays-Bas] ; Nick B. Szirbik [Pays-Bas]	Agent Behavior Alignment: A Mechanism to Overcome Problems in Agent Interactions During Runtime
000655 (2007)	A. M. Giese [Allemagne] ; C. Kaebe [Allemagne] ; J. H. Maruhn [Allemagne] ; E. W. Sachs [Allemagne, États-Unis]	Efficient calibration for problems in option pricing
000912 (2005)	Christian Kullberg [Suède]	Differences in the Seriousness of Problems and Deservingness of Help: Swedish Social Workers’ Assessments of Single Mothers and Fathers
000950 (2004)	Christian Kullberg	Work and Social Support: Social Workers’ Assessments of Male and Female Clients’ Problems and Needs
000B08 (2003)	G. Still [Pays-Bas]	Approximation theory methods for solving elliptic eigenvalue problems
000B74 (2002)	Eran Halperin [Israël] ; Uri Zwick [Israël]	A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
000C14 (2001)	M. Stubbs [Allemagne]	Texts, corpora, and problems of interpretation: a response to Widdowson
000D70 (1999)	Carsten Damm [Allemagne] ; Ki Hang Kim [États-Unis] ; Fred Roush [États-Unis]	On Covering and Rank Problems for Boolean Matrices and Their Applications
000F77 (1997)	Christoph Meinel [Allemagne] ; Anna Slobodová [Allemagne]	A reducibility concept for problems defined in terms of ordered binary decision diagrams
001036 (1996)	A. Kaplan [Allemagne] ; R. Tichatschke [Allemagne]	Path-following proximal approach for solving Ill-posed convex semi-infinite programming problems
001047 (1996)	Christoph Meinel [Allemagne] ; S. Waack [Allemagne]	Lower bounds for the majority communication complexity of various graph accessibility problems
001149 (1995)	Christoph Meinel [Allemagne] ; Stephan Waack	Lower bounds for the modular communication complexity of various graph accessibility problems
001150 (1995)	Christoph Meinel [Allemagne] ; Stephan Waack	Lower bounds for the majority communication complexity of various graph accessibility problems
001247 (1994)	Nguyen V. Thoai [Allemagne]	On the construction of test problems for concave minimization algorithms
001306 (1993)	Juan Carlos Díaz [Espagne]	Two problems of Valdivia on distinguished Frechet spaces
001326 (1993)	Klaus Jansen [Allemagne]	On scheduling problems restricted to interval orders
001414 (1992)	R. Horst [Allemagne] ; N. V. Thoai [Viêt Nam]	Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems

---

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Checkpoint

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Title.i -k "problems" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Title.i  \
                -Sk "problems" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Istex/Checkpoint/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=   Checkpoint
   |type=    indexItem
   |index=    Title.i
   |clé=    problems
}}

---

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