终点
发表于 2025-3-30 10:28:35
Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines,l or unrelated) machines in order to minimize the makespan. We consider the following process: at first the agents declare the length of their tasks, then given these bids the protocol schedules the tasks on the machines. The aim of the protocol is to minimize the makespan, i.e. the maximal completi
BAIL
发表于 2025-3-30 12:54:49
http://reply.papertrans.cn/59/5801/580043/580043_52.png
纬线
发表于 2025-3-30 16:39:23
http://reply.papertrans.cn/59/5801/580043/580043_53.png
eardrum
发表于 2025-3-30 22:25:12
Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight,the polygon boundary to illuminate all intruders. We want to minimize the total distance traveled by the robot until all intruders are detected in the worst case. We present an .(.log.) time and .(.) space algorithm for optimizing this metric, where . is the number of vertices of the given polygon.
spondylosis
发表于 2025-3-31 03:51:37
http://reply.papertrans.cn/59/5801/580043/580043_55.png
凌辱
发表于 2025-3-31 06:04:46
Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling,to be scheduled on a subset of machines. We study the worst-case behavior of local search algorithms. In particular, we analyze the quality of local optima with respect to the jump, swap, push and lexicographical jump neighborhood.
Perceive
发表于 2025-3-31 11:29:04
Packet Routing on the Grid,al routing problems with important practical applications, e.g., in traffic routing, parallel computing, and the design of communication protocols. The problem involves critical routing and scheduling decisions. One has to determine a suitable (short) origindestination path for each packet and resol
phase-2-enzyme
发表于 2025-3-31 16:53:46
Faithful Representations of Graphs by Islands in the Extended Grid,t it is related to a number of other well studied grid embedding problems. Such problems typically deal with representing vertices by grid points, and edges by grid paths, while minimizing some objective function such as the area or the maximum length of the grid paths representing the edges. Our pa
Concerto
发表于 2025-3-31 19:44:10
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication,ty of this task up to a constant factor for all meaningful choices of the parameters . (dimension of the matrices), . (average number of non-zero entries per column or row in ., i.e., there are in total . non-zero entries), . (main memory size), and . (block size), as long as . ≥ .. (tall cache assu
支形吊灯
发表于 2025-3-31 23:08:46
http://reply.papertrans.cn/59/5801/580043/580043_60.png