نتایج جستجو برای: optimization algorithmis iteratively run since a pre

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

2000
Michael Eisenring Marco Platzner

Run-time reconfigurable approaches for FPGAs are gaining interest as they enlarge the design space for system implementation by sequential execution of temporally exclusive system parts on one or several FPGA resources. In [7], we introduced a novel methodology and a design tool for communication synthesis in reconfigurable embedded systems. In [5], this work was extended by a hierarchical reco...

2006
Michael C. Fu Jiaqiao Hu Steven I. Marcus

We survey some randomized search methods for global optimization that are based on sampling from an underlying probability distribution “model” on the solution space. In this approach, the probability model is updated iteratively after evaluating the performance of the samples at each iteration. Such model-based methods include estimation of distribution algorithms (EDAs), the cross-entropy met...

Journal: :Anthropocene 2021

• N14CP model applied across the UK simulates soil and biomass C from 1700 to 2020. N deposition increased in natural land offsetting loss arable expansion. Natural improved grassland show increases whilst areas decrease. Terrestrial carbon storage has by 6.9 % Land use change is a key mechanism for sequestration. Carbon stores terrestrial biosphere globally represent over 50 of present-day org...

Journal: :Journal of the Optical Society of America. A, Optics, image science, and vision 2014
Calvin B Shaw Phaneendra K Yalavarthy

The sparse estimation methods that utilize the ℓp-norm, with p being between 0 and 1, have shown better utility in providing optimal solutions to the inverse problem in diffuse optical tomography. These ℓp-norm-based regularizations make the optimization function nonconvex, and algorithms that implement ℓp-norm minimization utilize approximations to the original ℓp-norm function. In this work, ...

Computation offloading is known to be among the effective solutions of running heavy applications on smart mobile devices. However, irregular changes of a mobile data rate have direct impacts on code partitioning when offloading is in progress. It is believed that once a rate-adaptive partitioning performed, the replication of such substantial processes due to bandwidth fluctuation can be avoid...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تبریز 1381

‏‎this study investigated the effect of prior knowledge on the listening comprehension performance of fl learners. twenty students, male and female, drawn from the two intact groups of the senior and junior english language and literature majors were chosen as the participants of this study . the two groups were then randomly assigned into the experimental and control group. the experimental gr...

Journal: :نشریه دانشکده فنی 0
دکتر خسرو اویسی

this paper is a case study of the cause of distress and evaltion of main runway (29 l-ll r) of mahrabad international airport in 1320 , this run way was built (1800 length & 60 width ) from pcc for small aircrafts. later on 1329 and 13 39 the length of this run way was inc reased to 3000 m and 4000m , respectedly was increased to 3000m and 4000m,respectedly .since 1320, this run wa y h a s bee ...

Journal: :International Journal of Reconfigurable Computing 2008

2010
Riham Abdel Kader Maurice van Keulen Peter A. Boncz Stefan Manegold

Traditional optimizers fail to pick good execution plans, when faced with increasingly complex queries and large data sets. This failure is even more acute in the context of XQuery, due to the structured nature of the XML language. To overcome the vulnerabilities of traditional optimizers, we have previously proposed ROX, a Run-time Optimizer for XQueries, which interleaves optimization and exe...

Journal: :J. Global Optimization 1993
Zelda B. Zabinsky Robert L. Smith J. F. McDonald H. Edwin Romeijn David E. Kaufman

Improving Hit-and-Run is a random search algorithm for global optimization that at each iteration generates a candidate point for improvement that is uniformly distributed along a randomly chosen direction within the feasible region. The candidate point is accepted as the next iterate if it offers an improvement over the current iterate. We show that for positive definite quadratic programs, th...

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

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