Search Results - "Algorithm analysis"

Customized fastSLAM algorithm: analysis and assessment on real mobile platform by Maziarz, Bartosz, Domański, Paweł D.

“… The present work addresses the subject of the modified fastSLAM application using custom lidar as the detection sensor…”
Get full text

Single Image Dehazing Algorithm Analysis with Hyperspectral Images in the Visible Range by Martínez-Domingo, Miguel Ángel, Valero, Eva M., Nieves, Juan L., Molina-Fuentes, Pedro Jesús, Romero, Javier, Hernández-Andrés, Javier

“…In foggy or hazy conditions, images are degraded due to the scattering and attenuation of atmospheric particles, reducing the contrast and visibility and…”
Get full text

Temporal Network Optimization Subject to Connectivity Constraints by Mertzios, George B., Michail, Othon, Spirakis, Paul G.

“…In this work we consider temporal networks , i.e. networks defined by a labeling λ assigning to each edge of an underlying graph G a set of discrete…”
Get full text

Developing a Clinical Prediction Rule for Gait Independence at Discharge in Patients with Stroke: A Decision-Tree Algorithm Analysis by Inoue, Yu, Imura, Takeshi, Tanaka, Ryo, Matsuba, Junji, Harada, Kazuhiro

“… We included 181 subjects with stroke during the postacute phase. The Chi-squared automatic interaction detection analysis method with 10-fold cross-validation was used to develop two CPRs…”
Get full text

Developing a Clinical Prediction Rule for Gait Independence at Discharge in Patients with Stroke: A Decision-Tree Algorithm Analysis by Yu, Inoue, Takeshi, Imura, Ryo, Tanaka, Junji, Matsuba, Kazuhiro, Harada

Get full text

Practical Budgeted Submodular Maximization by Feldman, Moran, Nutov, Zeev, Shoham, Elad

“…We consider the problem of maximizing a non-negative monotone submodular function subject to a knapsack constraint, which is also known as the Budgeted Submodular Maximization ( BSM ) problem. Sviridenko (Operat Res Lett 32:41–43, 2004…”
Get full text

Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint by Huang, Chien-Chung, Kakimura, Naonori

“…In this paper, we consider the problem of maximizing a monotone submodular function subject to a knapsack constraint in a streaming setting…”
Get full text

Stochastic Variance Reduction for DR-Submodular Maximization by Lian, Yuefang, Du, Donglei, Wang, Xiao, Xu, Dachuan, Zhou, Yang

“…Stochastic optimization has experienced significant growth in recent decades, with the increasing prevalence of variance reduction techniques in stochastic…”
Get full text

Drift Analysis with Fitness Levels for Elitist Evolutionary Algorithms by He, Jun, Zhou, Yuren

“… To answer this question, we combine drift analysis with fitness levels and define the tightest bound problem as a constrained multiobjective optimization problem subject to fitness levels…”
Get more information

Guess Free Maximization of Submodular and Linear Sums by Feldman, Moran

“…We consider the problem of maximizing the sum of a monotone submodular function and a linear function subject to a general solvable polytope constraint…”
Get full text

Runtime Analysis for Self-adaptive Mutation Rates by Doerr, Benjamin, Witt, Carsten, Yang, Jing

“…We propose and analyze a self-adaptive version of the ( 1 , λ ) evolutionary algorithm in which the current mutation rate is encoded within the individual and thus also subject to mutation…”
Get full text

On Maximizing Sums of Non-monotone Submodular and Linear Functions by Qi, Benjamin

“…We study the problem of Regularized Unconstrained SubmodularMaximization (RegularizedUSM) as defined by Bodek and Feldman (Maximizing sums of non-monotone…”
Get full text

Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima by Jorritsma, Joost, Lengler, Johannes, Sudholt, Dirk

“… Comma selection may help to escape from local optima, however when and how it is beneficial is subject to an ongoing debate…”
Get full text

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion by Blažej, Václav, Jana, Satyabrata, Ramanujan, M. S., Strulo, Peter

“… out (subject to the usual…”
Get full text

Algorithm Analysis of Sparse Matrix Multiplication by Ren, Hui, Ma, Hongwei, Kang, Jian, Liu, Yang, Wang, Lu, Zheng, Xiaogang

“… of wireless communication, but also realizes the confidentiality of communication. The development of effective algorithms for matrix calculation has been an interesting subject for several centuries and an expanding research field…”
Get full text

Sublinear Algorithms in T-Interval Dynamic Networks by Jahja, Irvan, Yu, Haifeng

“… The edges in the network are always undirected, but the set of edges in the topology may change arbitrarily from round to round, as determined by some adversary and subject to the following constraint…”
Get full text

Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center by Kim, Kangsan, Shin, Yongho, An, Hyung-Chan

“…Facility location is a prominent optimization problem that has inspired a large quantity of both theoretical and practical studies in combinatorial…”
Get full text

Provenance-Aware Knowledge Representation: A Survey of Data Models and Contextualized Knowledge Graphs by Sikos, Leslie F., Philp, Dean

“…Expressing machine-interpretable statements in the form of subject-predicate-object triples is a well-established practice for capturing semantics of structured data…”
Get full text

Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes Under Bit-Wise Noise by Qian, Chao, Bian, Chao, Jiang, Wu, Tang, Ke

“…In many real-world optimization problems, the objective function evaluation is subject to noise, and we cannot obtain the exact objective value…”
Get full text

Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint by Huang, Chien-Chung, Kakimura, Naonori, Yoshida, Yuichi

“…In this paper, we consider the problem of maximizing a monotone submodular function subject to a knapsack constraint in the streaming setting…”
Get full text