Treffer 241 - 260 von 32.133

241

AVERAGE SUBMODULARITY OF MAXIMIZING ANTICOORDINATION IN NETWORK GAMES.
DAS, SOHAM ; EKSIN, CEYHUN
SIAM Journal on Control & Optimization. 2024, Vol. 62 Issue 5, p2639-2663. 25p.

GAME theory GRAPH theory APPROXIMATION algorithms GAMES BIPARTITE graphs NEIGHBORS
Fachzeitschrift
Zu den Favoriten
242

The stochastic multi-gradient algorithm for multi-objective optimization and its application to supervised machine learning.
Liu, S. ; Vicente, L. N.
Annals of Operations Research. Aug2024, Vol. 339 Issue 3, p1119-1148. 30p.

DECISION making ALGORITHMS SUPERVISED learning APPROXIMATION algorithms A priori
Fachzeitschrift
Zu den Favoriten
243

PTAS FOR MINIMUM COST MULTICOVERING WITH DISKS.
ZIYUN HUANG ; QILONG FENG ; JIANXIN WANG ; et al.
SIAM Journal on Computing. 2024, Vol. 53 Issue 4, p1181-1215. 35p.

DYNAMIC programming APPROXIMATION algorithms COMPUTATIONAL geometry SENSOR networks POINT set theory
Fachzeitschrift
Zu den Favoriten
244

Integrated scheduling of production and distribution with two competing agents.
Cheng, Bayi ; Gao, Junwei ; Zhou, Mi ; et al.
Journal of the Operational Research Society. Sep2024, Vol. 75 Issue 9, p1826-1836. 11p.

PRODUCTION scheduling SCHEDULING ALGORITHMS MACHINERY APPROXIMATION algorithms
Fachzeitschrift
Zu den Favoriten
245

Bayesian variable selection and estimation in multivariate skew-normal generalized partial linear mixed models for longitudinal data.
He, Peng-Fei ; Duan, Xind-De
Communications in Statistics: Simulation & Computation. 2024, Vol. 53 Issue 9, p4503-4518. 16p.

ALGORITHMS LEAST squares APPROXIMATION algorithms SMOOTHNESS of functions DATA modeling
Fachzeitschrift
Zu den Favoriten
246

Routing Among Convex Polygonal Obstacles in the Plane.
Inkulu, R. ; Kumar, Pawan
International Journal of Foundations of Computer Science. Sep2024, Vol. 35 Issue 6, p723-739. 17p.

COMPUTATIONAL geometry APPROXIMATION algorithms GEOMETRY
Fachzeitschrift
Zu den Favoriten
247

Local Optimization Algorithms for Maximum Planar Subgraph
Călinescu, Gruia ; Uniyal, Sumedha ; Illinois Institute of Technology ; et al.

2012 ACM Subject Classif... planar graph maximum subgraph approximation algorithm matroid parity local optimization
E-Ressource
Zu den Favoriten
248

Optimization problems in graphs with locational uncertainty
Bougeret, Marin ; Omer, Jérémy ; Poss, Michael ; et al.
INFORMS Journal on Computing. 35(3):578-592

Combinatorial optimizati... Cutting plane algorithms Approximation algorithms NP-hardness Robust optimization [INFO.INFO-RO]Computer S...
Zeitschrift
Zu den Favoriten
249

Single machine robust scheduling with budgeted uncertainty
Bougeret, Marin ; Pessoa, Artur, Alves ; Poss, Michael ; et al.
Operations Research Letters. 51(2):137-141

Robust scheduling NP-hardness Approximation algorithms [INFO.INFO-RO]Computer S... Operations Research [mat...
Zeitschrift
Zu den Favoriten
250

Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles
Grange, Aristide ; Kacem, Imed ; Martin, Sébastien ; et al.
RAIRO - Operations Research. 57(1):1-16

Approximation algorithms scheduling FPTAS dynamic programming [MATH]Mathematics [math]
Zeitschrift
Zu den Favoriten
251

Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce.
BOROUJENI, MAHDI ; EHSANI, SOHEIL ; GHODSI, MOHAMMAD ; et al.
Journal of the ACM. May2021, Vol. 68 Issue 3, p1-41. 41p.

ALGORITHMS APPROXIMATION algorithms PARALLEL algorithms
Fachzeitschrift
Zu den Favoriten
252

Analysis of a Class of Minimization Problems Lacking Lower Semicontinuity.
Han, Shaoning ; Cui, Ying ; Pang, Jong-Shi
Mathematics of Operations Research. Aug2025, Vol. 50 Issue 3, p2175-2198. 24p.

MATHEMATICAL optimizatio... STOCHASTIC programming APPROXIMATION algorithms CONVEX domains
Fachzeitschrift
Zu den Favoriten
253

Truly asymptotic lower bounds for online vector bin packing
János Balogh ; Ilan Reuven Cohen ; Leah Epstein ; et al.
Mathematical Programming.

online algorithms Bin packing 01.02. Számítás- és info... ddc:004 vector packing approximation algorithms
Fachzeitschrift
Zu den Favoriten
254

Optimal Volume-Sensitive Bounds for Polytope Approximation
Sunil Arya ; David M. Mount ; Sunil Arya and David M. Mount
Discrete & Computational Geometry.

Macbeath regions Computational Geometry (... FOS: Computer and inform... convexity Computational Geometry ddc:004
Fachzeitschrift
Zu den Favoriten
255

Semi-streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints
Chien-Chung Huang ; François Sellier ; Huang, Chien-Chung
Algorithmica. 86:3598-3628

FOS: Computer and inform... Theory of computation →... sublinear and near linea... 0211 other engineering a... 2012 ACM Subject Classif... Theory of computation →...
Fachzeitschrift
Zu den Favoriten
256

Heterogeneous Multi-resource Allocation with Subset Demand Requests.
Baxter, Arden ; Keskinocak, Pinar ; Singh, Mohit
INFORMS Journal on Computing. Sep/Oct2022, Vol. 34 Issue 5, p2389-2399. 11p.

TRAVEL costs INTEGER programming APPROXIMATION algorithms INTEGERS LOCATION problems (Progr...
Fachzeitschrift
Zu den Favoriten
257

Delivery network design of a locker-drone delivery system.
Bipan Zou ; Siqing Wu ; Yeming Gong ; et al.
International Journal of Production Research. 2024, Vol. 62 Issue 11, p4097-4121. 25p.

DELIVERY of goods DRONE aircraft delivery COST analysis APPROXIMATION algorithms GENETIC algorithms
Fachzeitschrift
Zu den Favoriten
258

Partition Based Algorithms for Rearrangement Distances With Flexible Intergenic Regions
Gabriel Siqueira ; Alexsandro Oliveira Alexandrino ; Andre Rodrigues Oliveira ; et al.
IEEE Transactions on Computational Biology and Bioinformatics. 22:455-468

[INFO.INFO-CC]Computer S... Rearrangement Distance Bioinformatics [INFO.INFO-DS]Computer S... Genomics Transforms
Fachzeitschrift
Zu den Favoriten
259

Joint Client and Cross-Client Edge Selection for Cost-Efficient Federated Learning of Graph Convolutional Networks
Guangjing Huang ; Xu Chen ; Qiong Wu ; et al.
IEEE Transactions on Networking. 33:286-298

Social networking (onlin... Data models Servers Collaboration Approximation algorithms Costs
Fachzeitschrift
Zu den Favoriten
260

A 2-approximation algorithm for the softwired parsimony problem on binary, tree-child phylogenetic networks
Martin Frohn ; Steven Kelk
Annals of Operations Research. 345:125-145

Phylogenetics Combinatorial optimizati... Optimization and Control... FOS: Biological sciences Populations and Evolutio... FOS: Mathematics
Fachzeitschrift
Zu den Favoriten

Filter