algometer < algorithm < algorithmen

Facettes :

List of bibliographic references

Number of relevant bibliographic references: 82.
[0-20] [0 - 20][0 - 50][20-40]

Ident.	Authors (with country if any)	Title
000723 (1995)	Ivind Due Trier [Norvège] ; Torfinn Taxt [Norvège]	Improvement of “integrated function algorithm” for binarization of document images
000870 (1996)	Reiner Horst [Allemagne] ; Nguyen Van Thoai [Allemagne]	A new algorithm for solving the general quadratic programming problem
000893 (2000)	J. Baasansuren [Allemagne] ; A. A. Khan [Allemagne]	Regularized auxiliary problem principle for variational inequalities
000960 (1987)	Jörg Hettich [Allemagne] ; E. Haaren [Allemagne] ; M. Ries [Allemagne] ; G. Still [Allemagne]	Accurate Numerical Approximations of Eigenfrequencies and Eigenfunctions of Elliptic Membranes
000965 (1995)	Klaus Jansen [Allemagne] ; Gerhard J. Woeginger [Autriche] ; Zhongliang Yu [Autriche, République populaire de Chine]	UET-scheduling with chain-type precedence constraints
000997 (1994)	Klaus Jansen [Allemagne]	An approximation algorithm for the license and shift class design problem
000B14 (1986)	R. Hettich [Allemagne]	An implementation of a discretization method for semi-infinite programming
000B39 (2010)	Anna Kasprzik [Allemagne]	Generalizing over Several Learning Settings
000B50 (1995)	S. Ito [Japon] ; C. T. Kelley ; E. W. Sachs [Allemagne]	Inexact primal-dual interior point iteration for linear programs in function spaces
000B66 (2005)	Roland Griesse [Autriche] ; Andrea Walther [Allemagne]	Towards Matrix‐Free AD‐Based Preconditioning of KKT Systems in PDE‐Constrained Optimization
000D24 (1990)	Harold P. Benson [États-Unis] ; S. Selcuk Erenguc [États-Unis] ; Reiner Horst [Allemagne]	A note on adapting methods for continuous global optimization to the discrete case
000D86 (1991)	Hoang Tuy [Viêt Nam]	Normal conical algorithm for concave minimization over polytopes
000E36 (1997)	Klaus Jansen [Allemagne]	Approximation results for the optimum cost chromatic partition problem
000E42 (1996)	M. Gugat [Allemagne]	The Newton differential correction algorithm for rational Chebyshev approximation with constrained denominators
000E52 (2006)	Henning Fernau [Allemagne]	edge dominating set : Efficient Enumeration-Based Exact Algorithms
000E72 (2006)	Henning Fernau [Allemagne, Royaume-Uni]	Parameterized Algorithms for Hitting Set : The Weighted Case
000F04 (1991)	R. Horst [Allemagne] ; T. Q. Phong [Viêt Nam] ; Ng. V. Thoai [Viêt Nam] ; J. De Vries [Allemagne]	On solving a D.C. programming problem by a sequence of linear programs
000F30 (1991)	Reiner Horst [Allemagne] ; Nguyen V. Thoai [Viêt Nam] ; Harold P. Benson [États-Unis]	Concave minimization via conical partitions and polyhedral outer approximation
000F63 (2002)	Christoph Meinel [Allemagne] ; Harald Sack [Allemagne] ; Arno Wagner [Suisse]	WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms
000F64 (2009)	Stefan N Her [Allemagne] ; Daniel Schmitt [Allemagne]	Multi-core Implementations of Geometric Algorithms
000F67 (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/Curation

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Curation/AbsEn.i -k "algorithm" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Curation/AbsEn.i  \
                -Sk "algorithm" \
         | 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é=    algorithm
}}

---

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