Results 1  10
of
24,573
Genetic Algorithms for Multiobjective Optimization: Formulation, Discussion and Generalization
, 1993
"... The paper describes a rankbased fitness assignment method for Multiple Objective Genetic Algorithms (MOGAs). Conventional niche formation methods are extended to this class of multimodal problems and theory for setting the niche size is presented. The fitness assignment method is then modified to a ..."
Abstract

Cited by 633 (15 self)
 Add to MetaCart
The paper describes a rankbased fitness assignment method for Multiple Objective Genetic Algorithms (MOGAs). Conventional niche formation methods are extended to this class of multimodal problems and theory for setting the niche size is presented. The fitness assignment method is then modified to allow direct intervention of an external decision maker (DM). Finally, the MOGA is generalised further: the genetic algorithm is seen as the optimizing element of a multiobjective optimization loop, which also comprises the DM. It is the interaction between the two that leads to the determination of a satisfactory solution to the problem. Illustrative results of how the DM can interact with the genetic algorithm are presented. They also show the ability of the MOGA to uniformly sample regions of the tradeoff surface.
A General Formulation for a
 Mathematical PEM Fuel Cell Model”. J. Power Sources
, 2005
"... Abstract: Spatialtemporal equalizer can be used in the wireless communication systems with antenna arrays to improve the performance. In this article, we introduce two blind adaptive algorithms for spatialtemporal equalization, and present their convergence. Computer simulation demonstrates that ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract: Spatialtemporal equalizer can be used in the wireless communication systems with antenna arrays to improve the performance. In this article, we introduce two blind adaptive algorithms for spatialtemporal equalization, and present their convergence. Computer simulation demonstrates that the new algorithms converge faster than fractionally spaced constantmodulus algorithm (FSCMA).
General Formulation and Notations
"... Suppose we are given a set of noisy observations of the atmosphere for a time interval τ Let γ = {x = x(t), t ∈ τ} be the trajectory in τ We want to determine which trajectory γ fits the observations “best” The state estimate xa(ta) for a given time ta along the γa solution trajectory is called the ..."
Abstract
 Add to MetaCart
Suppose we are given a set of noisy observations of the atmosphere for a time interval τ Let γ = {x = x(t), t ∈ τ} be the trajectory in τ We want to determine which trajectory γ fits the observations “best” The state estimate xa(ta) for a given time ta along the γa solution trajectory is called the analysis for analysis time ta
Fronts propagating with curvature dependent speed: algorithms based on Hamilton–Jacobi formulations
, 1988
"... We devise new numerical algorithms, called PSC algorithms, for following fronts propagating with curvaturedependent speed. The speed may be an arbitrary function of curvature, and the front also can be passively advected by an underlying flow. These algorithms approximate the equations of motion, w ..."
Abstract

Cited by 1183 (60 self)
 Add to MetaCart
in the moving fronts. The algorithms handle topological merging and breaking naturally, work in any number of space dimensions, and do not require that the moving surface be written as a function. The methods can be also used for more general HamiltonJacobitype problems. We demonstrate our algorithms
A general formulation for LMP evaluation
 IEEE Trans. Power Syst
, 2007
"... Abstract—The evaluation of locational marginal prices or LMPs, which constitute the basis of the new generation of market design in the U.S., is a critical need in the sidebyside operation of electricity markets and power systems. Their use in various applications such as congestion management a ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
and hedging requires specific LMP components in the computations. We provide a general formulation for the evaluation of the LMP components by making explicit use of the important role played by the nodes with generators with free capacity. On the other hand, the LMPs of the nodes without generation
A General Formulation For Support Vector Machines
 In Proceedings of the 9th International Conference on Neural Information Processing
"... In this paper, we derive a general formulation of support vector machines for classification and regression respectively. ..."
Abstract
 Add to MetaCart
In this paper, we derive a general formulation of support vector machines for classification and regression respectively.
The Stable Model Semantics For Logic Programming
, 1988
"... We propose a new declarative semantics for logic programs with negation. Its formulation is quite simple; at the same time, it is more general than the iterated fixed point semantics for stratied programs, and is applicable to some useful programs that are not stratified. ..."
Abstract

Cited by 1847 (63 self)
 Add to MetaCart
We propose a new declarative semantics for logic programs with negation. Its formulation is quite simple; at the same time, it is more general than the iterated fixed point semantics for stratied programs, and is applicable to some useful programs that are not stratified.
Axiomatic quantum field theory in curved spacetime
, 2008
"... The usual formulations of quantum field theory in Minkowski spacetime make crucial use of features—such as Poincare invariance and the existence of a preferred vacuum state—that are very special to Minkowski spacetime. In order to generalize the formulation of quantum field theory to arbitrary globa ..."
Abstract

Cited by 689 (18 self)
 Add to MetaCart
The usual formulations of quantum field theory in Minkowski spacetime make crucial use of features—such as Poincare invariance and the existence of a preferred vacuum state—that are very special to Minkowski spacetime. In order to generalize the formulation of quantum field theory to arbitrary
Large margin methods for structured and interdependent output variables
 JOURNAL OF MACHINE LEARNING RESEARCH
, 2005
"... Learning general functional dependencies between arbitrary input and output spaces is one of the key challenges in computational intelligence. While recent progress in machine learning has mainly focused on designing flexible and powerful input representations, this paper addresses the complementary ..."
Abstract

Cited by 624 (12 self)
 Add to MetaCart
to accomplish this, we propose to appropriately generalize the wellknown notion of a separation margin and derive a corresponding maximummargin formulation. While this leads to a quadratic program with a potentially prohibitive, i.e. exponential, number of constraints, we present a cutting plane algorithm
Results 1  10
of
24,573