中文
相关论文

相关论文: Efficient Algorithms for Moral Lineage Tracing

200 篇论文

Multirobot systems for covering environments are increasingly used in applications like cleaning, industrial inspection, patrolling, and precision agriculture. The problem of covering a given environment using multiple robots can be…

多智能体系统 · 计算机科学 2020-01-10 Mirko Salaris , Alessandro Riva , Francesco Amigoni

Mixed-integer linear programming (MILP) is a powerful tool for addressing a wide range of real-world problems, but it lacks a clear structure for comparing instances. A reliable similarity metric could establish meaningful relationships…

机器学习 · 计算机科学 2025-07-16 Gwen Maudet , Grégoire Danoy

We consider the task of obtaining the maximum a posteriori estimate of discrete pairwise random fields with arbitrary unary potentials and semimetric pairwise potentials. For this problem, we propose an accurate hierarchical move making…

人工智能 · 计算机科学 2012-05-14 M. Pawan Kumar , Daphne Koller

The classical linear ordering problem seeks a single ranking representing a given preference matrix. While suitable for homogeneous populations, it fails when observed preferences arise from several latent groups with distinct ranking…

Mixed-integer linear programming (MILP) has been a fundamental problem in combinatorial optimization. Conventional MILP solving mainly relies on carefully designed heuristics embedded in the branch-and-bound framework. Driven by the strong…

人工智能 · 计算机科学 2026-01-13 Siyuan Li , Yifan Yu , Zhihao Zhang , Mengjing Chen , Fangzhou Zhu , Tao Zhong , Peng Liu , Jianye Hao

The accurate segmentation and tracking of cells in microscopy image sequences is an important task in biomedical research, e.g., for studying the development of tissues, organs or entire organisms. However, the segmentation of touching…

计算机视觉与模式识别 · 计算机科学 2020-12-10 Tim Scherr , Katharina Löffler , Moritz Böhland , Ralf Mikut

Mixed-integer rounding (MIR) cutting planes (cuts) are effective at improving the strength of a linear relaxation for mixed-integer linear programming (MIP) problems. The cuts in this family are derived by aggregating constraints then…

最优化与控制 · 数学 2024-12-16 Oscar Guaje , Arnaud Deza , Aleksandr M. Kazachkov , Elias B. Khalil

Rapid advance of experimental techniques provides an unprecedented in-depth view into complex developmental processes. Still, little is known on how the complexity of multicellular organisms evolved by elaborating developmental programs and…

分子网络 · 定量生物学 2021-07-16 Somya Mani , Tsvi Tlusty

Early detection and assessment of polyps play a crucial role in the prevention and treatment of colorectal cancer (CRC). Polyp segmentation provides an effective solution to assist clinicians in accurately locating and segmenting polyp…

计算机视觉与模式识别 · 计算机科学 2025-01-22 Jiaxin Mei , Tao Zhou , Kaiwen Huang , Yizhe Zhang , Yi Zhou , Ye Wu , Huazhu Fu

We consider the primal problem of finding the zeros of the sum of a maximally monotone operator with the composition of another maximally monotone operator with a linear continuous operator and a corresponding dual problem formulated by…

最优化与控制 · 数学 2012-06-27 Radu Ioan Bot , Ernö Robert Csetnek , Andre Heinrich

Combinatorial sequential decision making problems are typically modeled as mixed integer linear programs (MILPs) and solved via branch and bound (B&B) algorithms. The inherent difficulty of modeling MILPs that accurately represent…

人工智能 · 计算机科学 2025-12-15 Akhil S Anand , Elias Aarekol , Martin Mziray Dalseg , Magnus Stalhane , Sebastien Gros

In this paper, we propose a Feasible Sequential Linear Programming (FSLP) algorithm applied to time-optimal control problems (TOCP) obtained through direct multiple shooting discretization. This method is motivated by TOCP with nonlinear…

Mixed-Integer Linear Programming (MILP) is a foundational tool for complex decision-making problems. However, the NP-hard nature of MILP presents a significant computational challenge, motivating the development of machine learning-based…

最优化与控制 · 数学 2026-03-03 Hongpei Li , Hui Yuan , Han Zhang , Jianghao Lin , Dongdong Ge , Mengdi Wang , Yinyu Ye

We present linear-time algorithms for partitioning a path or a tree with weights on the vertices by removing $k$ edges to maximize the minimum-weight component. We also use the same framework to partition a path with weight on the vertices,…

数据结构与算法 · 计算机科学 2017-11-03 Greg N. Frederickson , Samson Zhou

This note uses the Total Least-Squares (TLS) line-fitting problem as a canvas to explore some modern optimization tools. The contribution is meant to be tutorial in nature. The TLS problem has a lot of mathematical similarities to important…

机器人学 · 计算机科学 2022-06-13 Timothy D Barfoot , Connor Holmes , Frederike Dumbgen

Recent growing complexity in space missions has led to an active research field of space logistics and mission design. This research field leverages the key ideas and methods used to handle complex terrestrial logistics to tackle space…

最优化与控制 · 数学 2025-08-27 Koki Ho , Yuri Shimane , Masafumi Isaji

Microscopy imaging plays a vital role in understanding many biological processes in development and disease. The recent advances in automation of microscopes and development of methods and markers for live cell imaging has led to rapid…

计算机视觉与模式识别 · 计算机科学 2017-05-10 Saad Ullah Akram , Juho Kannala , Lauri Eklund , Janne Heikkilä

Detection, segmentation and tracking of fruits and vegetables are three fundamental tasks for precision agriculture, enabling robotic harvesting and yield estimation applications. However, modern algorithms are data hungry and it is not…

计算机视觉与模式识别 · 计算机科学 2023-01-30 Thomas A. Ciarfuglia , Ionut M. Motoi , Leonardo Saraceni , Mulham Fawakherji , Alberto Sanfeliu , Daniele Nardi

The virtual machine consolidation problem (VMCP) attempts to determine which servers to be activated, how to allocate virtual machines (VMs) to the activated servers, and how to migrate VMs among servers such that the summation of…

数据结构与算法 · 计算机科学 2022-12-26 Jiang-Yao Luo , Liang Chen , Wei-Kun Chen , Jian-Hua Yuan , Yu-Hong Dai

The paper proposes a linesearch for a primal-dual method. Each iteration of the linesearch requires to update only the dual (or primal) variable. For many problems, in particular for regularized least squares, the linesearch does not…

最优化与控制 · 数学 2018-03-26 Yura Malitsky , Thomas Pock
‹ 上一页 1 8 9 10 下一页 ›