نتایج جستجو برای: optimization dynamic programing

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

2001
Nir Friedman Itsik Pe’er Tal Pupko

The problem of ancestral sequence reconstruction is the statistical inference of sequences that correspond to internal nodes in a phylgenetic tree [1]. Joint reconstruction is the task of seeking the most likely set of ancestral states corresponding to all the ancestral taxa, while marginal reconstruction aims at inferring the sequence in a specific internal node. In simple probabilistic models...

Journal: :Operations Research 2010
Oleksandr Shlakhter Chi-Guhn Lee Dmitry Khmelev Nasser Jaber

We propose a general approach to accelerate the convergence of the widely used solution methods of Markov decision processes. The approach is inspired by the monotone behavior of the contraction mappings in the feasible set of the linear programming problem equivalent to the MDP. Numerical studies show that the computational savings can be significant especially in the cases where the standard ...

2014
Shenlong Wang Alexander G. Schwing Raquel Urtasun

In this paper, we prove that every multivariate polynomial with even degree can be decomposed into a sum of convex and concave polynomials. Motivated by this property, we exploit the concave-convex procedure to perform inference on continuous Markov random fields with polynomial potentials. In particular, we show that the concave-convex decomposition of polynomials can be expressed as a sum-of-...

In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...

Journal: :CoRR 2011
Michal A. Zabicki

Received Day Month Year Revised Day Month Year This work presents a methodology for studying active Brownian dynamics on ratchet potentials using interoperating OpenCL and OpenGL frameworks. Programing details along with optimization issues are discussed, followed by a comparison of performance on different devices. Time of visualization using OpenGL sharing buffer with OpenCL has been tested a...

Journal: :Annals OR 2013
Savas Dayanik Mahmut Parlar

Search-based advertising allows the advertisers to run special campaigns targeted to different groups of potential consumers at low costs. Google, Yahoo and Microsoft advertising programs allow the advertisers to bid for an ad position on the result page of a user when the user searches for a keyword that the advertiser relates to its products or services. The expected revenue generated by the ...

Journal: :مرتع و آبخیزداری 0
حشمت اله آقارضی عضو هیئت علمی مرکز تحقیقات کشاورزی و منابع طبیعی استان مرکزی مهدی مردیان دانشجوی دکتری آبخیزداری دانشگاه علوم کشاورزی و منابع طبیعی ساری علی اکبر داوودی راد دانشجوی دکتری آبخیزداری دانشگاه تربیت مدرس و عضو هیئت علمی مرکز تحقیقات کشاورزی و منابع طبیعی استان مرکزی داوود نیک کامی دانشیار پژوهشکدة حفاظت خاک و آبخیزداری

land use optimization using linear programing is a method in watershed management for access to production sustainability and decreasing of soil erosion. the sensitivity analysis of the model can with investigation of results influence form changes in input parameters, lead to decrease the uncertainty in decision-making of management programs. so in this research, linear programming model using...

2013
Ioanna Iacovides Dominic Furniss

Prescription charts are not designed with the task of programing medical devices in mind [cf. 1]. This is surprising because we know that charts need to be consulted for programing values. This paper summarizes what we know about chart design, and then reflects on what we do not know. In order to design charts that facilitate programing, we need a better understanding of how they are used in ho...

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

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