Search Results - algorithms: Subject classifications: programming

Phase recovery, MaxCut and complex semidefinite programming by Waldspurger, Irène, d’Aspremont, Alexandre, Mallat, Stéphane

“… ) similar to the classical MaxCut semidefinite program. We solve this problem using a provably convergent block coordinate descent algorithm whose structure is similar…”
Get full text

A sliding window algorithm for energy distribution system with storage by Chehab, Jean-Paul, Desveaux, Vivien, Handa, Marouan

“…This work is devoted to study optimization problems arising in energy distribution systems with storage. We consider a simplified network topology organized…”
Get full text

Optimization of venture portfolio based on LSTM and dynamic programming by Ban, Jiuchao, Wang, Yiran, Liu, Bingjie, Li, Hongjun

“…-term memory time series and the dynamic programming model combined with the greedy algorithm has been proposed in this paper…”
Get full text

Predicting Students’ Performance in University Courses: A Case Study and Tool in KSU Mathematics Department by Badr, Ghada, Algobail, Afnan, Almutairi, Hanadi, Almutery, Manal

“…’ academic records can be analyzed to explore the factors behind these phenomena. This paper discusses the building of a model to predict the performance of students in a programming course based on their grades in courses in other subjects…”
Get full text

Research on dynamic domain adaptation selective ensemble algorithm for cross-subject EEG emotion classification by Qin, Yuanxian, Li, Danyang, Qin, Xue, Li, Chunlong, Li, Jialin, Yuan, Jiafan

“… However, significant differences among subjects in skull structure, EEG physiological characteristics, and emotional perception lead to strong heterogeneity in cross-subject EEG signals, severely…”
Get full text

Weighted minimax programming subject to the max-min fuzzy relation inequalities by Chen, Miaoxia, Shibghatullah, Abdul Samad, Subramaniam, Kasthuri, Yang, Xiaopeng

“… As a consequence, we establish a weighted minimax programming model in which the constraint is the max-min FRIs…”
Get full text

P.078 fMRI-based deep brain stimulation programming: a blinded, crossover clinical trial by Santyr, B, Ajala, A, Alhashyan, I, Germann, J, Qiu, J, Boutet, A, Fasano, A, Lozano, A

“… Optimal settings were identified using our published classification algorithm. Subjects then underwent…”
Get full text

Type inference in flexible model-driven engineering using classification algorithms by Zolotas, Athanasios, Matragkas, Nicholas, Devlin, Sam, Kolovos, Dimitrios S., Paige, Richard F.

“…Flexible or bottom-up model-driven engineering (MDE) is an emerging approach to domain and systems modelling. Domain experts, who have detailed domain…”
Get full text

Models and algorithms for distributionally robust least squares problems by Mehrotra, Sanjay, Zhang, He

“… For the first case, we give an equivalent formulation and show that the optimization problem can be solved using a semidefinite optimization reformulation or polynomial time algorithms…”
Get full text

n-Fold integer programming in cubic time by Hemmecke, Raymond, Onn, Shmuel, Romanchuk, Lyubov

“… The fastest algorithm for n -fold integer programming predating the present article runs in time with L the binary length of the numerical part of the input and g…”
Get full text

Multi-objective mathematical programming subject to box boundary constraints on system parameters by Khoder, H

“…Multi-objective mathematical programming subject to box constraints on system parameters is an important problem in the fields of computer-aided design and decision-making theory, when there is…”
Get full text

Multiobjective Program and Hybrid Imperialist Competitive Algorithm for the Mixed-Model Two-Sided Assembly Lines Subject to Multiple Constraints by Li, Dashuang, Zhang, Chaoyong, Tian, Guangdong, Shao, Xinyu, Li, Zhiwu

“… In order to describe the actual condition, this paper presents a novel multiobjective programming model for balancing a mixed-model two-sided assembly line subject to multiple constraints…”
Get full text

The complexity of optimizing over a simplex, hypercube or sphere: a short survey by de Klerk, Etienne

“…We consider the computational complexity of optimizing various classes of continuous functions over a simplex, hypercube or sphere. These relatively simple…”
Get full text

Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model by Freund, Robert M, Vera, Jorge R

“…Consider the supposedly simple problem of computing a point in a convex set that is conveyed by a separation oracle with no further information (e.g., no…”
Get full text

Offloading Algorithms for Maximizing Inference Accuracy on Edge Device in an Edge Intelligence System by Fresa, Andrea, Champati, Jaya Prakash

“…With the emergence of edge computing, the problem of offloading jobs between an Edge Device (ED) and an Edge Server (ES) received significant attention in the…”
Get full text

LP-based approximation algorithms for capacitated facility location by Levi, Retsef, Shmoys, David B., Swamy, Chaitanya

“…In the capacitated facility location problem with hard capacities, we are given a set of facilities, , and a set of clients in a common metric space. Each…”
Get full text

RSTFC: A Novel Algorithm for Spatio-Temporal Filtering and Classification of Single-Trial EEG by Qi, Feifei, Li, Yuanqing, Wu, Wei

“…, brain-computer interfaces (BCIs). To tackle these barriers, this paper presents a novel algorithm, termed regularized spatio-temporal filtering and classification (RSTFC…”
Get full text

NP-hardness of deciding convexity of quartic polynomials and related problems by Ahmadi, Amir Ali, Olshevsky, Alex, Parrilo, Pablo A., Tsitsiklis, John N.

“…) algorithm that can decide whether a multivariate polynomial of degree four (or higher even degree…”
Get full text

Interpretable optimisation-based approach for hyper-box classification by Liapis, Georgios I., Tsoka, Sophia, Papageorgiou, Lazaros G.

“… Mathematical programming-based classification algorithms have attracted considerable attention due to their ability to effectively compete with leading-edge algorithms in terms of both accuracy and interpretability…”
Get full text

Copositivity and constrained fractional quadratic problems by Amaral, Paula, Bomze, Immanuel M., Júdice, Joaquim

“…) and Standard Fractional Quadratic Problem (StFQP). Based on these formulations, Semidefinite Programming relaxations are derived for finding good lower bounds…”
Get full text