Results 21 to 30 of about 13,203 (237)
Branch and price for submodular bin packing
The Submodular Bin Packing (SMBP) problem asks for packing unsplittable items into a minimal number of bins for which the capacity utilization function is submodular.
Liding Xu +3 more
doaj +1 more source
Some Results about the Contractions and the Pendant Pairs of a Submodular System [PDF]
Submodularity is an important property of set functions with deep theoretical results and various applications. Submodular systems appear in many applicable area, for example machine learning, economics, computer vision, social science, game theory ...
Saeid Hanifehnezhad, Ardeshir Dolati
doaj +1 more source
Learning submodular functions [PDF]
There has been much interest in the machine learning and algorithmic game theory communities on understanding and using submodular functions. Despite this substantial interest, little is known about their learnability from data. Motivated by applications, such as pricing goods in economics, this paper considers PAC-style learning of submodular ...
Balcan, Maria-Florina +1 more
openaire +2 more sources
In this paper, we consider parallel-machine scheduling with release times and submodular penalties (P|rj,reject|Cmax+π(R)), in which each job can be accepted and processed on one of m identical parallel machines or rejected, but a penalty must paid if a ...
Wencheng Wang, Xiaofei Liu
doaj +1 more source
In this paper, we focus on solving the vector scheduling problem with submodular penalties on parallel machines. We are given n jobs and m parallel machines, where each job is associated with a d-dimensional vector.
Bihui Cheng, Wencheng Wang
doaj +1 more source
Approximation Algorithms for the Submodular Load Balancing with Submodular Penalties
In this paper, we study the submodular load balancing problem with submodular penalties. The objective of this problem is to balance the load among sets, while some elements can be rejected by paying some penalties. Officially, given an element set V, we
Xiaofei Liu, Peiyin Xing, Weidong Li
doaj +1 more source
An Improved Approximation Algorithm for the Minimum Power Cover Problem with Submodular Penalty
In this paper, we consider the minimum power cover problem with submodular penalty (SPMPC). Given a set U of n users, a set S of m sensors and a penalty function π:2U→R+ on the plane, the relationship that adjusts the power p(s) of each sensor s and its ...
Han Dai
doaj +1 more source
SFExt-PGAbs: Two-Stage Summarization Model for Long Document
Aiming at the fluency problem of extractive method, the accuracy problem of abstractive method, and the important information missing problem caused by truncating the original document before document encoding, this paper proposes a two-stage long ...
ZHOU Weixiao, LAN Wenfei, XU Zhiming, ZHU Rongbo
doaj +1 more source
Reconfiguration Problems on Submodular Functions [PDF]
Reconfiguration problems require finding a step-by-step transformation between a pair of feasible solutions for a particular problem. The primary concern in Theoretical Computer Science has been revealing their computational complexity for classical problems.
Naoto Ohsaka, Tatsuya Matsuoka
openaire +2 more sources
Subquadratic submodular function minimization [PDF]
Submodular function minimization (SFM) is a fundamental discrete optimization problem which generalizes many well known problems, has applications in various fields, and can be solved in polynomial time. Owing to applications in computer vision and machine learning, fast SFM algorithms are highly desirable. The current fastest algorithms [Lee, Sidford,
Deeparnab Chakrabarty +3 more
openaire +2 more sources

