亚洲国产午夜成人影院_日韩精品欧美大片资源在线观看网站_(凹凸影业)亚洲人成网站在线在线_无码高清在线观看少妇_一级毛片免费网站视频丿_婷婷五月综合色视频_菠萝菠萝蜜在线视频3_亚洲AV成人一区不卡_日韩一级生活毛片_国产精品亚洲手机版

歡迎進(jìn)入 yl7703永利官網(wǎng)

當(dāng)前位置: yl7703永利官網(wǎng) > 學(xué)術(shù)交流 > 正文

第七屆機(jī)器學(xué)習(xí)與優(yōu)化會(huì)議

日期:2024-05-16點(diǎn)擊數(shù):

主辦單位

   蘭州大學(xué)  中國(guó)運(yùn)籌學(xué)會(huì)數(shù)學(xué)規(guī)劃分會(huì)


承辦單位 

   yl7703永利官網(wǎng)


會(huì)議時(shí)間 

   2024 年 5 月 17 日-5 月 19 日


會(huì)議簡(jiǎn)介 

  第七屆機(jī)器學(xué)習(xí)與優(yōu)化會(huì)議 (The Seventh Annual Conference on Machine Learning and Optimization, MLO 2024) 將于 2024 年 5 月 17-19 日在甘肅省蘭州市 舉行。本次會(huì)議由蘭州大學(xué)和中國(guó)運(yùn)籌學(xué)會(huì)數(shù)學(xué)規(guī)劃分會(huì)共同舉辦,旨在為國(guó) 內(nèi)外專家學(xué)者分享學(xué)術(shù)成果和技術(shù)經(jīng)驗(yàn),聚焦機(jī)器學(xué)習(xí)及組合優(yōu)化等領(lǐng)域的前 沿研究,提供一個(gè)良好的交流平臺(tái)。會(huì)議開放投搞,優(yōu)秀稿件將被邀請(qǐng)到 International Journal of Foundations of Computer Science 等期刊。


會(huì)議網(wǎng)址

/MLO2024/


會(huì)議日程簡(jiǎn)表


08:00-08:35

開幕式及大會(huì)合影

yl7703永利官網(wǎng)院長(zhǎng)鄧偉華教授講話

會(huì)議發(fā)起人、北京工業(yè)大學(xué)徐大川教授講話

中國(guó)運(yùn)籌學(xué)會(huì)數(shù)學(xué)規(guī)劃分會(huì)理事長(zhǎng)、北京交通大學(xué)孔令臣教授講話

中國(guó)運(yùn)籌學(xué)會(huì)副理事長(zhǎng)、曲阜師范大學(xué)張玉忠教授講話

主持人:李憲越 教授

地點(diǎn):逸夫科學(xué)館二樓報(bào)告廳

大會(huì)報(bào)告(地點(diǎn):逸夫科學(xué)館二樓報(bào)告廳)

時(shí)間

主持人

報(bào)告人

報(bào)告題目

08:40-09:30

張昭

堵丁柱

New Solution of Golovin-Krause Conjecture

09:30-10:20

杜東雷

郭田德

Machinelearningmethodfor Combinatorial optimization

10:20-10:40

茶歇

會(huì)議投稿報(bào)告(地點(diǎn):逸夫科學(xué)館二樓報(bào)告廳)

10:40-11:00

劉彬

李文華

Online scheduling under a non-renewable resource constraint with periodic supply

11:00-11:20

屈 彪

Inertial forward-reflected-backward splitting method with line search for non-convex split feasibility problem

11:20-11:40

郭龍坤

Streaming Fair DR-submodular Maximization over Integer Lattice

11:40-12:00

金 晶

An Improved Algorithm for Maximization of Strongly DR-Submodular Function Under Convex Constraint




518日下午,地點(diǎn):蘭州大學(xué)城關(guān)校區(qū)西區(qū)逸夫科學(xué)館

會(huì)議投稿報(bào)告第一組(地點(diǎn):逸夫科學(xué)館201室

時(shí)間

主持人

報(bào)告人

報(bào)告題目

14:20-14:40

韓鑫

常 虹

On Two-Stage BP Maximization

14:40-15:00

丁林飛

Visual Attention Dynamic Reconfiguration Mechanism for Unmanned Aerial Vehicle Swarm Network Reconstruction

15:00-15:20

李 攀

Adaptive Task Migration for Link Dynamics in Multiplex Networked Industrial Networks

15:20-15:40

李 攀

Predicting Production Capacity in Multi-tier Networked Industrial Chains Based on Multi-scale Dynamic Aggregation Network

15:40-16:00

李 攀

Collaborative Risk-Avoidance Model for Foraging Robots in Adversarial Environments

16:00-16:20

茶歇

16:20-16:40

周洋

譚靜靜

Streaming algorithm for balance gain and cost on the integer lattice

16:40-17:00

宋傳明

Adaptive virtual inertia and damping vibration suppression method for flexible joint drive system

17:00-17:20

陶 婷

An inexact LPA for DC composite optimization and application to matrix completions with outliers

17:20-17:40

張 龍

Price of anarchy for parallel batch-machine scheduling games under coordination mechanisms

17:40-18:00

張 瑩

A new non-parameter filled function method for discrete global optimization and its application in the assignment problem

會(huì)議投稿報(bào)告第二組(地點(diǎn):逸夫科學(xué)館202室

時(shí)間

主持人

報(bào)告人

報(bào)告題目

14:20-14:40

李偉東

蔡力健

Combinatorial algorithms for solving the multiple knapsack problem with divisible item sizes and penalties

14:40-15:00

趙越

Partial Symmetric Regularized Alternating Direction Method of Multipliers for Non-convex Split Feasibility Problems

15:00-15:20

胡唯嘉

Approximation Algorithms for $k$-Submodular Maximization under Fair Constraints and Size Constraints

15:20-15:40

李廣鳳

An Lasserre SDP Rounding Approximation Algorithm for Max Directed 3-Section

15:40-16:00

涂 凱

Variance Reduced Random Relaxed Projection Method for Constrained Finite-sum Minimization Problems

16:00-16:20

茶歇

16:20-16:40

張亞璞

楊瑞琪

A Note of Approximating Sequence Submodular Maximization with Bounded Curvature

16:40-17:00

張洪祥

Approximation algorithm for nonmonotone pseudo-submodular function maximization problem

17:00-17:20

張洪祥

Non-submodular maximization subject to a knapsack constraint on the integer lattice

17:20-17:40

張宏揚(yáng)

The budget-feasible mechanisms on non-monotone k-submodular objectives for the offline and online procurements

17:40-18:00

張心雨

Streaming algorithms of $k$-submodular maximization subject to a partition matroid constraint




519日上午,地點(diǎn):蘭州大學(xué)城關(guān)校區(qū)西區(qū)逸夫科學(xué)館

會(huì)議投稿報(bào)告第一組(地點(diǎn):逸夫科學(xué)館201室

時(shí)間

主持人

報(bào)告人

報(bào)告題目

08:20-08:40

肖漢

黃保斌

A metaheuristic algorithm for a molten iron tank routing problem arising in the steel industry

08:40-09:00

李 敏

The seeding algorithms for k-median problem and fuzzy k-median problem

09:00-09:20

孟憲浩

An approximation algorithm for generalized connectivity problem on planar graphs

09:20-09:40

孟憲浩

1.6-approximation algorithm for generalized traveling salesman path problem

09:40-10:00

甘杭鑫

Approximate Nash Equilibria Algorithms for Shapley Network Design Games

10:00-10:20

茶歇

10:20-10:40

苗翠霞

王嘉維

UAV Path Planning for Object Coverage: An Approximation Algorithm

10:40-11:00

王嘉維

Multiagent Reinforcement Learning-Based Flow Splitting for Combinatorial Network Packet Routing Problem

11:00-11:20

王修君

A Block-wise Updating Strategy for Approximate Duplicate Detection



會(huì)議投稿報(bào)告第二組(地點(diǎn):逸夫科學(xué)館202室

08:20-08:40

錄嶺法

都杏妹

Research on probabilistic linguistic group consensus decision-making methods incorporating trust relationships

08:40-09:00

蓋 玲

Selfish Open-end Bin Packing

09:00-09:20

蓋 玲

Facility Location Game with Distance Constraint

09:20-09:40

孔凡雨

Knapsack Problems with Variable Item Weights or Profits

09:40-10:00

左麗麗

Single machine scheduling with a restricted weight-modifying activity to minimize the weighted makespan

10:00-10:20

茶歇

10:20-10:40

常小凱

賁樹軍

Sparse signal reconstruction: sequential convex relaxation, restricted null space property and error bounds

10:40-11:00

郭浩

Multi-resource maximin share fair allocation in heterogeneous servers with time discount

11:00-11:20

肖亮海

A relaxation method for binary orthogonal optimization problems with its applications

11:20-11:40

閉幕式,地點(diǎn):逸夫科學(xué)館201