即席演说
发表于 2025-3-28 16:59:44
http://reply.papertrans.cn/16/1529/152895/152895_41.png
逢迎白雪
发表于 2025-3-28 22:20:51
http://reply.papertrans.cn/16/1529/152895/152895_42.png
积习难改
发表于 2025-3-29 02:35:07
http://reply.papertrans.cn/16/1529/152895/152895_43.png
fabricate
发表于 2025-3-29 03:17:04
http://reply.papertrans.cn/16/1529/152895/152895_44.png
Antarctic
发表于 2025-3-29 08:48:00
Line Facility Location in Weighted Regions,es, find a line . such that the sum of the weighted distances from the fixed points to . is minimized. The weighted region setup is a more realistic model for many facility location problems that arise in practical applications. Our algorithms exploit an interesting property of the problem, that cou
atopic
发表于 2025-3-29 11:57:47
Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems,ral scenario can be described as follows. The microprocessor temperature is controlled by the hardware thermal management system that continuously senses the chip temperature and automatically reduces the processor’s speed as soon as the thermal threshold is exceeded. Some tasks are more CPU-intensi
凝视
发表于 2025-3-29 18:07:00
http://reply.papertrans.cn/16/1529/152895/152895_47.png
Sleep-Paralysis
发表于 2025-3-29 23:31:45
On the Fast Searching Problem, this widely studied problem. Fast searching corresponds to an internal monotone search in which every edge is traversed exactly once and searchers are not allowed to jump. We present a linear time algorithm to compute the fast search number of trees. We investigate the fast search number of biparti
可憎
发表于 2025-3-30 02:38:33
Copeland Voting Fully Resists Constructive Control,ting (which is here denoted by Copeland.) and a variant (here denoted by Copeland.) of Copeland voting are computationally resistant to many, yet not all, types of constructive control and that they also provide broad resistance to bribery. We study a parameterized version of Copeland voting, denote
Respond
发表于 2025-3-30 06:56:14
The Complexity of Power-Index Comparison,.’s power index value higher? We study this problem with respect to both the Shapley-Shubik power index and the Banzhaf power index . Our main result is that for both of these power indices the problem is complete for probabilistic polynomial time (i.e., is PP-complete). We apply our resul