ACM Home Page

Searching within The Guide for: Subject:"Minimax approximation and algorithms"  (start a new search)

Found 790 of 1,394,228

REFINE YOUR SEARCH

ADVANCED SEARCH
Advanced search.  Advanced Search

FEEDBACK
Please provide us with feedback. Please provide us with feedback

Found 790 of 1,394,228

Results 1 - 20 of 790
Sort by in
Result page: 1   2   3   4   5   6   7   8   9   10    next    >>
1
Resource optimization in wireless and optical networks
January 2007
Resource optimization in wireless and optical networks
Publisher: University of Texas at Dallas
Additional Information:full citation, abstract, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

In this work, we discuss some resource optimization problems in wireless and optical networks. In chapter 1, we consider Minimum Strongly Connected Dominating and Absorbent Set (MSCDAS) problem in a heterogeneous wireless ad-hoc network, where nodes ...

2
Abort landing in the presence of windshear as a minimax optimal control problem, part 1: necessary conditions
June 1991
Journal of Optimization Theory and Applications , Volume 70 Issue 1
Publisher: Plenum Press
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

Keywords: ABORT LANDING, BANG-BANG CONTROLS, CHEBYSHEV-TYPE OPTIMAL CONTROL PROBLEMS, FLIGHT MECHANICS, LANDING, MINIMAX OPTIMAL CONTROL PROBLEMS, MULTIPLE SHOOTING METHODS, MULTIPOINT BOUNDARY-VALUE PROBLEMS, OPTIMAL CONTROL, OPTIMAL TRAJECTORIES, SINGULAR CONTROLS, STATE CONSTRAINTS, STATE CONSTRAINTS OF THIRD ORDER, WINDSHEAR PROBLEMS
3
Minimum multiway cuts in trees
October 1998
Discrete Applied Mathematics , Volume 87 Issue 1-3
Publisher: Elsevier Science Publishers B. V.
Additional Information:full citation, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 1
4
Bounded knapsack sharing
December 1994
Mathematical Programming: Series A and B , Volume 67 Issue 3
Publisher: Springer-Verlag New York, Inc.
Additional Information:full citation, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 1

Keywords: knapsack sharing problems, lower and upper bounds, maximin programming
5
Estimation of minimax values
December 1986
Proceedings of the ACM SIGART international symposium on Methodologies for intelligent systems
Publisher: ACM
Full text available: PdfPdf (520.12 KB)
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): 8,   Downloads (12 Months): 23,   Downloads (Overall): 180,    Citation Count: 0

In estimating minimax values, an important topic in the study of heuristic game tree searches, a pathological phenomenon sometimes results when the conventional minimax procedure is used as a back-up process. In this paper exact methods are derived for ...

6
An Algorithm for the Determination of the Polynomial of Best Minimax Approximation to a Function Defined on a Finite Point Set
July 1959
Journal of the ACM (JACM) , Volume 6 Issue 3
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (421.34 KB)
Additional Information:full citation, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 7,   Downloads (12 Months): 80,   Downloads (Overall): 321,    Citation Count: 1
7
On duality theorems for a nondifferentiable minimax fractional programming
September 2002
Journal of Computational and Applied Mathematics , Volume 146 Issue 1
Publisher: Elsevier Science Publishers B. V.
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 6

The optimality conditions of [Lai et al. (J. Math. Anal. Appl. 230 (1999) 311)] can be used to construct two kinds of parameter-free dual models of nondifferentiable minimax fractional programming problems which involve pseudo-/quasi-convex functions. ...


Keywords: duality, minimax fractional problem, polyhedral cone, pseudo-convex, quasi-convex
8
Locating An Undesirable Facility by Generalized Cutting Planes
March 1998
Mathematics of Operations Research , Volume 23 Issue 3
Publisher: INFORMS
Additional Information:full citation, abstract, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 2

We address the problem of locating an undesirable facility within a compact set by minimizing a strictly decreasing boundedly lower subdifferentiable function of the squared Euclidean distances to a set of fixed points. Using (generalized) cutting planes, ...


Keywords: Facility location, cutting planes, lower subdifferentiable functions, power diagrams
9
Minimax Regret Classifier for Imprecise Class Distributions
May 2007
The Journal of Machine Learning Research , Volume 8
Publisher: MIT Press
Full text available: PdfPdf (364.38 KB)
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): 7,   Downloads (12 Months): 41,   Downloads (Overall): 127,    Citation Count: 2

The design of a minimum risk classifier based on data usually stems from the stationarity assumption that the conditions during training and test are the same: the misclassification costs assumed during training must be in agreement with real costs, ...

10
Remarks on a class of elliptic problems with asymmetric nonlinearities
September 1995
Nonlinear Analysis: Theory, Methods & Applications , Volume 25 Issue 6
Publisher: Elsevier Science Ltd.
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

Keywords: Fucˇik spectrum, Morse theory, minimax methods, multiplicity
11
Experiment design in guaranteed identification
November 2007
Automation and Remote Control , Volume 68 Issue 11
Publisher: Plenum Press
Additional Information:full citation, abstract, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

Consideration was given to the optimal choice of inputs at identification of the control system parameters from the results of measurements under the assumption that the a priori information about the uncertain parameters and measurement errors is confined ...


Keywords: 02.30.Yy
12
Estimating the covariance matrix: a new approach
July 2003
Journal of Multivariate Analysis , Volume 86 Issue 1
Publisher: Academic Press, Inc.
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 3

In this paper, we consider the problem of estimating the covariance matrix and the generalized variance when the observations follow a nonsingular multivariate normal distribution with unknown mean. A new method is presented to obtain a truncated estimator ...


Keywords: Bartlett's decomposition, Stein result, covariance matrix, decision theory, generalized variance, improvement, minimax estimation
13
Barrier Trees on Poset-Valued Landscapes
March 2003
Genetic Programming and Evolvable Machines , Volume 4 Issue 1
Publisher: Kluwer Academic Publishers
Full text available: Publisher SitePublisher Site
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

Fitness landscapes have proved to be a valuable concept in evolutionary biology, combinatorial optimization, and the physics of disordered systems. Usually, a fitness landscape is considered as a mapping from a configuration space equipped with some ...


Keywords: Pareto points, barrier trees, landscape, partially ordered set, saddle points
14
On the number of divisors of a polynomial over GF(2)
July 1986
Proceedings of the 2nd international conference, AAECC-2 on Applied algebra, algorithmics and error-correcting codes
Publisher: Springer-Verlag New York, Inc.
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0
15
Learning and Exploitation Do Not Conflict Under Minimax Optimality
April 1997
ECML '97: Proceedings of the 9th European Conference on Machine Learning
Publisher: Springer-Verlag
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 2
16
Ky Fan inequalities and Nash equilibrium points without semicontinuity and compactness
July 1997
Journal of Optimization Theory and Applications , Volume 94 Issue 1
Publisher: Plenum Press
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

Keywords: Ky Fan inequalities, Nash equilibrium points, existence theorems
17
A minimax theorem for vector-valued functions, part 2
January 1991
Journal of Optimization Theory and Applications , Volume 68 Issue 1
Publisher: Plenum Press
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 1
18
On the terminal Steiner tree problem
October 2002
Information Processing Letters , Volume 84 Issue 2
Publisher: Elsevier North-Holland, Inc.
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 3

We investigate a practical variant of the well-known graph Steiner tree problem. In this variant, every target vertex is required to be a leaf vertex in the solution Steiner tree. We present hardness results for this variant as well as a polynomial time ...


Keywords: Steiner minimum tree, approximation algorithms, terminal Steiner tree
19
Approximate min--max theorems for Steiner rooted-orientations of graphs and hypergraphs
November 2008
Journal of Combinatorial Theory Series B , Volume 98 Issue 6
Publisher: Academic Press, Inc.
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

Given an undirected hypergraph and a subset of vertices S@?V with a specified root vertex r@?S, the Steiner Rooted-Orientation problem is to find an orientation of all the hyperedges so that in the resulting directed hypergraph the ''connectivity'' from ...


Keywords: Hypergraph, Orientation, Steiner tree
20
Game-theoretical control problems
December 1987
Game-theoretical control problems
Publisher: Springer-Verlag New York, Inc.
Additional Information:full citation, cited by, index terms, review
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 6
Result page: 1   2   3   4   5   6   7   8   9   10    next    >>