-
Differential Evolution Algorithm for Global Optimization Problems
Speaker: 王祖玲(杭州师范大学硕士研究生) Time: 19:30 – 20:30 (Time in Beijing) December 3, 2021 (Friday) Venue: 报告形式：线上会议 报告平台：腾讯会议（会议ID：335-281-241） Abstract: How to effectively solve the global optimization problem is always an inevitable problem in scientific research and engineering practice. Evolutionary algorithm is a random search algorithm based on population and independent of derivative, which can effectively solve complex […]
-
A Quest for Hybrid SAT Solvers
Speaker: 蔡少伟(中科院软件所研究员) Time: 2021年12月2日 15:00-16:30 – 09:15 – 16:40 (Time in Beijing) – December 2, 2021 (Thursday) Venue: 报告形式：线上会议 报告平台：腾讯会议（会议ID：169 500 126） Abstract: 命题逻辑可满足性问题（简称SAT）是第一个被证明为NP完全的问题，也是计算机科学的一个核心问题。SAT求解器在包括EDA，密码学，资源分配等多个实际场景中有重要应用。求解SAT的主要方法包括基于冲突学习的完备算法和基于局部搜索的不完备算法。SAT领域一个挑战就是如何结合两者优势设计高效混合算法。本报告将回顾作者在此方向的一些探索和结果。
-
2021网络经济博弈论坛
Speaker: Yuqing Kong(Peking University) Bo Li(Peking University) Boyu Zhang(Beijing Normal University) Qi Qi(Renmin University of China) Jianwei Huang(The Chinese University of Hong Kong, Shenzhen) Xiao Liu(Tsinghua University) Zhiyi Huang(The University of Hong Kong) Time: 09:15 – 16:40 (Time in Beijing) November 13, 2021 (Saturday) Venue: Registration is required to participate in the online conference. Link: […]
-
Introduction to Parallel Algorithms
Speaker: Yan Gu(professor in University of California, Riverside) Time: 10:20-11:20 (Time in Beijing) 15:20-16:20 (Time in Auckland) November 12, 2021 (Friday) Venue: B1-518B, Research Building 4 VooV Meeting ID: 359 812 755 Abstract: Parallel processors are ubiquitous nowadays and it is almost impossible to find a single-core processor, probably other than a toaster. However, very […]
-
Combining Clause Learning and Branch and Bound for MaxSAT
Speaker: Chuming Li(Huazhong University of Science and Technology) Host: HCP Time: 19:00 – 21:00 (Time in Beijing) November 10, 2021 (Wednesday) Venue: 腾讯会议 ID: 148 668 344 Abstract Branch and Bound (BnB) is a powerful technique that has been successfully used to solve many combinatorial optimization problems. However, MaxSAT is a notorious exception because BnB […]
-
Algorithms for general SAT
Speaker: Jian Ma(University of Electronic and Science Technology of China) Time: 10:00-12:00 (Time in Beijing) 15:00-17:00 (Time in Auckland) November 5, 2021 (Friday) Venue: Qingshuihe Campus Abstract: The CNF satisfiability problem is defined as follows: given a CNF formula , decide if there exists truth-value assignment to variables such that the formula evaluates to true. […]
-
The security issues in diffusion Auction
Speaker: Yuchao Song (master student in University of Electronic Science and Technology of China) Time: 10:00-11:00 (Time in Beijing) 15:00-16:00 (Time in Auckland) November 26, 2021 (Friday) Venue: B1-518B, Research Building 4 Abstract: With a rapid growth of social networks, promoting products through social networks has become a challenging and important problem for stakeholders. During […]
-
On the reals weakly low for K
Speaker: Liang Yu(professor in Nanjing University) Time: 15:00-16:00 (Time in Beijing) 20:00-21:00 (Time in Auckland) November 01, 2021 (Monday) Venue: B1-518B, Research Building 4 Abstract: Given an infinite set , real is called weakly low for on if there are infinitely many so that does not improve the prefix-free complexity of up to a constant. […]
-
Quasi-Isometric Graph-Simplifications
Speaker: Roger Su(University of Auckland) Time: 10:00-12:00 (Time in Beijing) 15:00-17:00 (Time in Auckland) October 29, 2021 (Friday) Venue: Qingshuihe Campus Abstract: Quasi-isometries are a concept originally used to study infinite algebraic objects. Here we apply quasi-isometries to finite graphs, and propose a theoretical framework for simplifying large-scale graphs. This framework consists of several goals, […]
-
Subset Feedback Vertex Set in Chordal Graph
Speaker: Tian Bai(University of Electronic and Science Technology of China) Time: 10:00-12:00 (Time in Beijing) 14:00-16:00 (Time in Auckland) October 15, 2021 (Friday) Venue: Qingshuihe Campus Abstract: The Subset Feedback Vertex Set (SFVS) problem takes as input a graph and a subset of vertices in . The task is to find a minimal set of […]