بدائل البحث:
algorithm cost » algorithm goa (توسيع البحث), algorithm aoa (توسيع البحث), algorithm its (توسيع البحث)
algorithm a » algorithm fa (توسيع البحث), algorithms a (توسيع البحث), algorithm _ (توسيع البحث)
a function » _ functional (توسيع البحث)
algorithm cost » algorithm goa (توسيع البحث), algorithm aoa (توسيع البحث), algorithm its (توسيع البحث)
algorithm a » algorithm fa (توسيع البحث), algorithms a (توسيع البحث), algorithm _ (توسيع البحث)
a function » _ functional (توسيع البحث)
-
281
Shuffled Linear Regression with Erroneous Observations
منشور في 2019"…We propose an optimal recursive algorithm that updates the estimate from the underdetermined function that is based on that permutation-invariant constraint. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
282
UAV Trajectory Planning for Data Collection from Time-Constrained IoT Devices
منشور في 2019"…We demonstrate the favourable characteristics of the proposed algorithms via extensive simulation results and analysis as a function of various system parameters, with benchmarking against two greedy algorithms based on distance and deadline metrics.…"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
283
Autonomous Robot Navigation Based On Recurrent Neural Networks
منشور في 2012احصل على النص الكامل
doctoralThesis -
284
Optimization metaheuristic for software testing
منشور في 2013"…SA evolves a solution by minimizing a function that is based on the contradictory objectives of coverage of events, diversity of events covered, and definite continuity of events. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
285
Contingency analysis of bulk power system using neural networks
منشور في 1998"…The performance of the RBFN is compared with a standard AC load flow algorithm…"
احصل على النص الكامل
احصل على النص الكامل
article -
286
Rate Adaptation in Dynamic Adaptive Video Streaming Over HTTP
منشور في 2021احصل على النص الكامل
doctoralThesis -
287
Weak-coupling, strong-coupling and large-order parametrization of the hypergeometric-Meijer approximants
منشور في 2020"…<p dir="ltr">Without Borel or Padé techniques, we show that for a divergent series with n! large-order growth factor, the set of hypergeometric series <sub>p</sub>F<sub>p</sub> -2 represents suitable approximants. …"
-
288
IMPROVING BER PERFORMANCE OF LDPC CODES BASED ON INTERMEDIATE DECODING RESULTS
منشور في 2007"…The behavior of the BP algorithm is first investigated as a function of number of decoder iterations, and it is shown that typical uncorrected error patterns can be classified into 3 categories: oscillating, nearly-constant, or random-like, with a predominance of oscillating patterns at high Signal-to-Noise (SNR) values. …"
احصل على النص الكامل
article -
289
Heuristics for graph decomposition
منشور في 2000"…To find a reasonable solution to this intractable problem, we suggest an approximate objective function that can be minimized by heuristic procedures. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
290
Fragment based protein structure prediction. (c2013)
منشور في 2016"…The method is based on a two-phase Scatter Search metaheuristic that minimizes the energy function. …"
احصل على النص الكامل
احصل على النص الكامل
masterThesis -
291
Performance Analysis of Artificial Neural Networks in Forecasting Financial Time Series
منشور في 2013احصل على النص الكامل
doctoralThesis -
292
Anonymizing multimedia documents
منشور في 2016"…We provide a sanitizing MD∗-algorithm to enforce de-linkability along with a utility function to evaluate the utility of multimedia documents that is preserved after the sanitizing process. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
293
CFD Based Airfoil Shape Optimization for Aerodynamic Drag Reduction
منشور في 2012احصل على النص الكامل
doctoralThesis -
294
The maximum common subgraph problem
منشور في 2017"…The result is an algorithm whose run time is bounded by a function exponential in the order of the smaller cover rather than in the order of the smaller graph.…"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
295
Simulations of the penetration of 6061-T6511 aluminum targets by spherical-nosed VAR 4340 steel projectiles
منشور في 2000"…In this paper a forcing function which is derived from a spherical-cavity expansion (SCE) analysis has been implemented in a transient dynamic finite element code. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
296
-
297
Modeling and Identification of Nonlinear DC Motor Drive Systems Using Recurrent Wavelet Networks
منشور في 2013احصل على النص الكامل
doctoralThesis -
298
Optimized 3D Deployment of UAV-Mounted Cloudlets to Support Latency-Sensitive Services in IoT Networks
منشور في 2019"…We formulate the problem as a mixed integer program, and propose an efficient meta-heuristic solution based on the ions motion optimization algorithm. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
299
On-demand deployment of multiple aerial base stations for traffic offloading and network recovery
منشور في 2019"…We present performance results for the proposed algorithm as a function of various system parameters and demonstrate its effectiveness compared to the close-to-optimal greedy approach and its superiority compared to recent related work from the literature.…"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
300
Diagnostic structure of visual robotic inundated systems with fuzzy clustering membership correlation
منشور في 2023"…In the predicted model, an analytical framework is created to operate the robot within predetermined areas while maximizing communication ranges. Additionally, a clustering algorithm with a fuzzy membership function is implemented, allowing the robots to advance in accordance with predefined clusters and arrive at their starting place within a predetermined amount of time. …"