中文
相关论文

相关论文: Efficient Decision-Making by Volume-Conserving Phy…

200 篇论文

Topology optimization methods have widely been used in various industries, owing to their potential for providing promising design candidates for mechanical devices. However, their applications are usually limited to the objects which do…

计算工程、金融与科学 · 计算机科学 2023-03-01 Yuki Sato , Hiroki Kobayashi , Changyoung Yuhn , Atsushi Kawamoto , Tsuyoshi Nomura , Noboru Kikuchi

We present a new compressed representation of free trajectories of moving objects. It combines a partial-sums-based structure that retrieves in constant time the position of the object at any instant, with a hierarchical…

数据结构与算法 · 计算机科学 2017-10-06 Nieves R. Brisaboa , Travis Gagie , Adrián Gómez-Brandón , Gonzalo Navarro , José R. Paramá

We consider the problem of fairly and efficiently allocating indivisible items (goods or bads) under capacity constraints. In this setting, we are given a set of categorized items. Each category has a capacity constraint (the same for all…

计算机科学与博弈论 · 计算机科学 2023-03-01 Hila Shoshan , Erel Segal-Halevi , Noam Hazon

In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is as follows: at each stage, a designated agent picks one object among those that remain.…

人工智能 · 计算机科学 2018-08-01 Aurélie Beynier , Sylvain Bouveret , Michel Lemaître , Nicolas Maudet , Simon Rey

The effective large-scale properties of materials with random heterogeneities on a small scale are typically determined by the method of representative volumes: A sample of the random material is chosen - the representative volume - and its…

偏微分方程分析 · 数学 2019-09-04 Julian Fischer

We develop a finite volume method for Maxwell's equations in materials whose electromagnetic properties vary in space and time. We investigate both conservative and non-conservative numerical formulations. High-order methods accurately…

计算物理 · 物理学 2023-07-25 Damian P. San Roman Alerigi , David I. Ketcheson , Boon S. Ooi

Stochastic optimization problems often involve data distributions that change in reaction to the decision variables. This is the case for example when members of the population respond to a deployed classifier by manipulating their features…

最优化与控制 · 数学 2020-12-15 Dmitriy Drusvyatskiy , Lin Xiao

We consider many-body problems in classical mechanics where a wide range of time scales limits what can be computed. We apply the method of optimal prediction to obtain equations which are easier to solve numerically. We demonstrate by…

数值分析 · 数学 2025-10-20 Anton Kast

In this work, we present a manipulation planning algorithm for a robot to keep an object stable under changing external forces. We particularly focus on the case where a human may be applying forceful operations, e.g. cutting or drilling,…

机器人学 · 计算机科学 2018-07-31 Lipeng Chen , Luis F. C. Figueredo , Mehmet Dogar

Robotic bin packing is widely deployed in warehouse automation, with current systems achieving robust performance through heuristic and learning-based strategies. These systems must balance compact placement with rapid execution, where…

机器人学 · 计算机科学 2026-03-10 Nikita Sarawgi , Omey M. Manyar , Fan Wang , Thinh H. Nguyen , Daniel Seita , Satyandra K. Gupta

We propose a novel algorithm to efficiently generate hidden structures to support arrangements of floating rigid objects. Our optimization finds a small set of rods and wires between objects and each other or a supporting surface (e.g.,…

图形学 · 计算机科学 2021-02-11 Sarah Kushner , Risa Ulinski , Karan Singh , David I. W. Levin , Alec Jacobson

Object queries are essential in information seeking and decision making in vast areas of applications. However, a query may involve complex conditions on objects and sets, which can be arbitrarily nested and aliased. The objects and sets…

编程语言 · 计算机科学 2020-12-25 Yanhong A. Liu , Jon Brandvein , Scott D. Stoller , Bo Lin

A buyer wishes to purchase a durable good from a seller who in each period chooses a mechanism under limited commitment. The buyer's valuation is binary and fully persistent. We show that posted prices implement all equilibrium outcomes of…

理论经济学 · 经济学 2021-06-01 Laura Doval , Vasiliki Skreta

Real-world combinatorial optimization problems are often stochastic and dynamic. Therefore, it is essential to make optimal and reliable decisions with a holistic approach. In this paper, we consider the dynamic chance-constrained knapsack…

神经与进化计算 · 计算机科学 2020-02-18 Hirad Assimi , Oscar Harper , Yue Xie , Aneta Neumann , Frank Neumann

This work establishes a solution to the problem of assessing the capacity of multi-object assemblies to withstand external forces without becoming unstable. Our physically-grounded approach handles arbitrary structures made from rigid…

机器人学 · 计算机科学 2025-06-25 Philippe Nadeau , Jonathan Kelly

We study a dynamic and stochastic knapsack problem in which a decision maker is sequentially presented with items arriving according to a Bernoulli process over $n$ discrete time periods. Items have equal rewards and independent weights…

概率论 · 数学 2019-10-29 Alessandro Arlotto , Xinchang Xie

The growing need for companies to reduce costs and maximize profits has led to an increased focus on logistics activities. Among these, inventory management plays a crucial role in minimizing organizational expenses by optimizing the…

Evolutionary multi-objective algorithms have been widely shown to be successful when utilized for a variety of stochastic combinatorial optimization problems. Chance constrained optimization plays an important role in complex real-world…

神经与进化计算 · 计算机科学 2023-03-06 Kokila Perera , Aneta Neumann , Frank Neumann

In many realistic problems of allocating resources, economy efficiency must be taken into consideration together with social equality, and price rigidities are often made according to some economic and social needs. We study the…

计算机科学与博弈论 · 计算机科学 2014-05-27 Wei Huang , Jian Lou , Zhonghua Wen

We study the classic Bin Packing problem in a fully-dynamic setting, where new items can arrive and old items may depart. We want algorithms with low asymptotic competitive ratio \emph{while repacking items sparingly} between updates.…

数据结构与算法 · 计算机科学 2018-05-18 Anupam Gupta , Guru Guruganesh , Amit Kumar , David Wajc