Results 1  10
of
792
On NonMonotone Solutions Of An Integrodifferential Equation In Linear Viscoelasticity
, 1996
"... . We consider the integrodifferential equation u(t; x) = R t 0 a(t \Gamma s)uxx (s; x)ds with initial and boundary conditions corresponding to the Rayleigh problem. The kernel has the form a(t) = a 0 + a1 t + R t 0 a 1 (s)ds, where a 0 0, a1 0, and a 1 2 L 1 loc (R+ ) is of positive type ..."
Abstract
 Add to MetaCart
and satisfies the condition R 1 0 e \Gammafflt ja 1 (t)jdt ! 1 for every ffl ? 0. Solving the equation numerically and performing a careful error analysis we show that the solution u(t; x) need not be nondecreasing in t 0 for fixed x ? 0, if a 1 is nonnegative, nonincreasing, and convex. The same result
The Extended Linear Complementarity Problem
, 1993
"... We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity of the biline ..."
Abstract

Cited by 788 (30 self)
 Add to MetaCart
of the bilinear objective function under a monotonicity assumption, the polyhedrality of the solution set of a monotone XLCP, and an error bound result for a nondegenerate XLCP. We also present a finite, sequential linear programming algorithm for solving the nonmonotone XLCP.
The PATH Solver: A NonMonotone Stabilization Scheme for Mixed Complementarity Problems
 OPTIMIZATION METHODS AND SOFTWARE
, 1995
"... The Path solver is an implementation of a stabilized Newton method for the solution of the Mixed Complementarity Problem. The stabilization scheme employs a pathgeneration procedure which is used to construct a piecewiselinear path from the current point to the Newton point; a step length acceptan ..."
Abstract

Cited by 213 (40 self)
 Add to MetaCart
acceptance criterion and a nonmonotone pathsearch are then used to choose the next iterate. The algorithm is shown to be globally convergent under assumptions which generalize those required to obtain similar results in the smooth case. Several implementation issues are discussed, and extensive
Nonmonotonic feature selection
 In Proc. Intl. Conf. Machine Learning
"... Abstract We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinatorial optimization problem, and is usually solved by an approximation. Conventional feature selection methods add ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
selection. To this end, we develop an algorithm for nonmonotonic feature selection that approximates the related combinatorial optimization problem by a Multiple Kernel Learning (MKL) problem. We also present a strategy that derives a discrete solution from the approximate solution of MKL, and show
with nonmonotonic functional response
, 2013
"... periodic solutions of a delayed predator–prey model ..."
Viable Nonmonotonic Applications
 Proceedings of the ECAI96 Workshop on
, 1996
"... Nonmonotonicity enhances the expressivity of a representation framework allowing highlevel representations of (inherently nonmonotonic) problems close to their natural specification. This gain in expressivity should not though compromise (severely) the computational effectiveness of the solutions ..."
Abstract
 Add to MetaCart
of the solutions based on nonmonotonic representations. In this paper we argue that for abduction and consequently also for other nonmonotonic frameworks to become viable for "reallife" applications it is important for these to be integrated with appropriate specialized constraint solvers for (low
Nonmonotonic Reasoning on Beowulf Platforms
 of Lecture Notes in Artificial Intelligence (LNCS
, 2003
"... Nonmonotonic logic programming systems, such as the various implementations of Answer Set Programming (ASP), are frequently used to solve problems with large search spaces. In spite of the impressive improvements in implementation technology, the sheer size of realistic computations required to sol ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
Nonmonotonic logic programming systems, such as the various implementations of Answer Set Programming (ASP), are frequently used to solve problems with large search spaces. In spite of the impressive improvements in implementation technology, the sheer size of realistic computations required
Nonmonotonic modal logic of belief
"... We propose an alternative nonmonotonic modal formalism called nonmonotonic modal logic of belief. It is based on replacing the classical fixpoint equation E = ThS(A ∪ {Mϕ: E 6`S ¬ϕ}) with the belief fixpoint equation E = ThS(A ∪ {Mϕ: E 6`S ¬Mϕ}). The solutions of the belief fixpoint equation, ca ..."
Abstract
 Add to MetaCart
We propose an alternative nonmonotonic modal formalism called nonmonotonic modal logic of belief. It is based on replacing the classical fixpoint equation E = ThS(A ∪ {Mϕ: E 6`S ¬ϕ}) with the belief fixpoint equation E = ThS(A ∪ {Mϕ: E 6`S ¬Mϕ}). The solutions of the belief fixpoint equation
Linkage Identification by Nonmonotonicity Detection for Overlapping Functions
 Evolutionary Computation
, 1999
"... This paper presents the linkage identification by nonmonotonicity detection (LIMD) procedure and its extension for overlapping functions by introducing the tightness detection (TD) procedure. The LIMD identifies linkage groups directly by performing order2 simultaneous perturbations on a pair of l ..."
Abstract

Cited by 36 (11 self)
 Add to MetaCart
This paper presents the linkage identification by nonmonotonicity detection (LIMD) procedure and its extension for overlapping functions by introducing the tightness detection (TD) procedure. The LIMD identifies linkage groups directly by performing order2 simultaneous perturbations on a pair
Nonmonotone stochastic generalized porous media equations
 J. Differential Equations
"... By using the Nash inequality and a monotonicity approximation argument, existence and uniqueness of strong solutions are proved for a class of nonmonotone stochastic generalized porous media equations. Moreover, we prove for a large class of stochastic PDE that the solutions stay in the smaller L2 ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
By using the Nash inequality and a monotonicity approximation argument, existence and uniqueness of strong solutions are proved for a class of nonmonotone stochastic generalized porous media equations. Moreover, we prove for a large class of stochastic PDE that the solutions stay in the smaller L
Results 1  10
of
792