نتایج جستجو برای: program efficiency

تعداد نتایج: 824021  

2003
Chiou-Ting Hsu Ming-Shen Hsieh

This paper presents an efficient segmentation approach for non-rigid video object. We propose to formulate the video object segmentation problem as the maximum a posteriori probability (MAP) problem and define the probabilistic models in terms of the object’s density function. Furthermore, in order to accurately represent the density function for video object with arbitrary shape and complex te...

2014
Ludger Rüschendorf

We apply the concept of cost efficient claims to Lévy market models and find in an application to German stock prizes considerable potential savings the optimal payoffs provide. The magnitude of savings is related to the strength of the market trend. It is shown that the cost-efficient options also exhibit an improved behaviour concerning hedging errors. In the second part we introduce addition...

Journal: :Computers & Chemical Engineering 2007
Zhenya Jia Marianthi G. Ierapetritou

The problem of short-term scheduling under uncertainty is addressed in this paper through a multiobjective optimization framework that ncorporates economic expectation, robustness, and flexibility in terms of demand satisfaction. In order to be able to identify Pareto optimal olutions, a new approach is applied which is based on normal boundary intersection (NBI) technique. The main advantage o...

2005
James Gross Adam Wolisz Hans-Florian Geerdes

It is well known that dynamic OFDMA systems potentially increase the spectral efficiency of wireless systems. They exploit diversity effects in time, space, and frequency by assigning system resources periodically to terminals. Informing the terminals about new assignments creates a signaling overhead. So far, simple signaling schemes have been presented in order to quantify the cost of signali...

2000
Martin Barbie Marcus Hagedorn Ashok Kaul

We analyze the interaction between risk sharing and capital accumulation in a stochastic OLG model with production. We give a complete characterization of interim Pareto optimality. Our characterization also subsumes equilibria with a PAYG social security system. In a competitive equilibrium interim Pareto optimality is equivalent to intergenerational exchange e¢ciency, which in turn implies dy...

2010
Yuan Fang Chee Yong Chan

We address the problem of skyline query processing for a count-based window of continuous streaming data that involves both totallyand partially-ordered attribute domains. In this problem, a fixedsize buffer of the N most recent tuples is dynamically maintained and the key challenge is how to efficiently maintain the skyline of the sliding window of N tuples as new tuples arrive and old tuples ...

2008
Marcin Studniarski M. STUDNIARSKI

We extend some necessary and sufficient conditions for strict local Pareto minima of orderm obtained by Jiménez (2002) to the case of weak ψ-sharp local Pareto minima, i.e., to the case when the local solution is not necessarily unique.

1997
Manuel Clergue Phillipe Collard

This paper deals with an important class of optimization problems, the Multiobjective Problems. A new Genetic Algorithm, called Dual Genetic Algorithm, is presented. Through two theoretical problems, we show that this approach appears to be eecient for Multiob-jective Optimization.

2007
Shaine Joseph Hyung W. Kang Uday Kumar Chakraborty

Significant improvement over a patented lens design is achieved using multi-objective evolutionary optimization. A comparison of the results obtained from NSGA2 and ε-MOEA is done. In our current study, ε-MOEA converged to essentially the same Pareto-optimal solutions as the one with NSGA2, but ε-MOEA proved to be better in providing reasonably good solutions, comparable to the patented design,...

Journal: :SIAM Journal on Optimization 2008
Marco C. Campi Simone Garatti

Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In previous contributions, it has been shown that solutions to uncertain convex programs that bear a high probability to satisfy uncertain constraints can be obtained at low computational cost through constraints randomiza...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید