Deduct
发表于 2025-3-23 10:35:46
Modeling Locality: A Probabilistic Analysis of LRU and FWFproperties of paging assessed by practical experience. In particular, the competitive ratios of paging algorithms that are known to be efficient in practice (e.g. LRU) are as poor as those of naive heuristics (e.g. FWF). It has been recognized that the main reason for these discrepancies lies in an
Terminal
发表于 2025-3-23 15:05:16
An Algorithm for Computing DNA Walksns of poor coverage. Finishing by walks is a process by which the DNA in these regions is resequenced. Selective sequencing is expensive and time consuming. Therefore, the laboratory process of finishing is modeled as an optimization problem aimed at minimizing laboratory cost. We give an algorithm
Promotion
发表于 2025-3-23 21:24:27
http://reply.papertrans.cn/16/1533/153288/153288_13.png
言外之意
发表于 2025-3-23 23:28:52
http://reply.papertrans.cn/16/1533/153288/153288_14.png
本能
发表于 2025-3-24 05:40:57
A Parameterized Algorithm for Upward Planarity Testingf the algorithms for upward planarity testing developed previously focused on special classes of graphs. In this paper we develop a parameterized algorithm for upward planarity testing that can be applied to all graphs and runs in .(.(.).. + .(.,ℓ).) time, where . is the number of vertices, . is the
Assault
发表于 2025-3-24 07:34:56
Fisher Equilibrium Price with a Class of Concave Utility Functionse logarithmic utility functions. We derive a duality relation between buyers and sellers under such utility functions, and use it to design a polynomial time algorithm for calculating equilibrium price, for the special case when either the number of sellers or the number of buyers is bounded by a co
eustachian-tube
发表于 2025-3-24 10:45:56
Hardness and Approximation Results for Packing Steiner Treest Steiner trees of undirected graphs, we show APX-hardness for 4 terminals. For packing Steiner-node-disjoint Steiner trees of undirected graphs, we show a logarithmic hardness result, and give an approximation guarantee of ., where . denotes the number of nodes. For the directed setting (packing ed
蛰伏
发表于 2025-3-24 15:47:11
Approximation Hardness of Dominating Set Problemsounds for various kinds of domination problems (connected, total, independent) in bounded degree graphs. For most of dominating set problems we prove asymptotically almost tight lower bounds. The results are applied to improve the lower bounds for other related problems such as the . problem and the
excursion
发表于 2025-3-24 20:05:32
http://reply.papertrans.cn/16/1533/153288/153288_19.png
Limpid
发表于 2025-3-25 01:21:19
http://reply.papertrans.cn/16/1533/153288/153288_20.png