標(biāo)題: Titlebook: Combinatorial Optimization and Applications; 14th International C Weili Wu,Zhongnan Zhang Conference proceedings 2020 Springer Nature Switz [打印本頁] 作者: 清楚明確 時(shí)間: 2025-3-21 17:28
書目名稱Combinatorial Optimization and Applications影響因子(影響力)
書目名稱Combinatorial Optimization and Applications影響因子(影響力)學(xué)科排名
書目名稱Combinatorial Optimization and Applications網(wǎng)絡(luò)公開度
書目名稱Combinatorial Optimization and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Combinatorial Optimization and Applications被引頻次
書目名稱Combinatorial Optimization and Applications被引頻次學(xué)科排名
書目名稱Combinatorial Optimization and Applications年度引用
書目名稱Combinatorial Optimization and Applications年度引用學(xué)科排名
書目名稱Combinatorial Optimization and Applications讀者反饋
書目名稱Combinatorial Optimization and Applications讀者反饋學(xué)科排名
作者: ACRID 時(shí)間: 2025-3-22 00:13 作者: 織布機(jī) 時(shí)間: 2025-3-22 03:34 作者: aviator 時(shí)間: 2025-3-22 06:14 作者: Platelet 時(shí)間: 2025-3-22 10:28 作者: 玷污 時(shí)間: 2025-3-22 14:47 作者: 玷污 時(shí)間: 2025-3-22 17:46
https://doi.org/10.1007/978-3-031-59846-3ing. The first algorithm obtains a fixed size sample and computes the approximate skyline on the sample. The error of the first algorithm is relatively small in most cases, and is almost independent of the input relation size. The second algorithm returns an .-approximation for the exact skyline. Th作者: palliate 時(shí)間: 2025-3-23 00:01
Swati Chauhan,Ojaswini Bansal,Anshul Puriyaeach point and its nearest line is minimized. In this paper, we design a deterministic bi-criteria approximation algorithm that runs in . time and returns at most . lines such that the minimized distance is within 16.. Here . is the minimized distance in the optimal solution with . line centers for 作者: 致詞 時(shí)間: 2025-3-23 02:12
Kazi Humayun Kabir,Md. Ayatullah Khans is challenging for two main reasons. First, querying on big data sources is costly and even impossible. Second, due to the uneven data quality and overlaps of data sources, querying low-quality sources may return unexpected errors. Thus, it is critical to study approximate query problems on big da作者: ATP861 時(shí)間: 2025-3-23 08:40 作者: 擁護(hù) 時(shí)間: 2025-3-23 11:10 作者: 重畫只能放棄 時(shí)間: 2025-3-23 14:50 作者: Arthr- 時(shí)間: 2025-3-23 21:53 作者: 現(xiàn)存 時(shí)間: 2025-3-23 22:14
The Smart Grid: Anchor of the Smart Cityxibility in their start times and so can be shifted in order to lower the peak power demand of the schedule. In this work, we consider a version of peak-demand scheduling where jobs are non-preemptible and have precedence constraints (e.g. job . cannot begin until job . has finished). This problem o作者: 嫌惡 時(shí)間: 2025-3-24 03:38
Funding a Smart City: , Concept to Actualitythm is dominated by the number of tasks because of an exponential dependence. We shift this exponential dependency from the number of tasks to a new parameter, which we call .. This novel parameterization enables to reduce the problem of finding an optimal schedule to one of searching for winning st作者: 無聊的人 時(shí)間: 2025-3-24 09:35
Angelo Miglietta,Emanuele Parisiurce. The resource may be distributed arbitrarily among the machines. This distribution is under the control of the scheduler and can be changed over time. Each job . has a processing volume . and a resource requirement .. The latter indicates what fraction of the resource a job requires to run at f作者: LEVY 時(shí)間: 2025-3-24 10:59
Shared Administration for Smart Citiesord-of-mouth effect. For product companies, designing effective marketing strategies is important for obtaining profit. However, most existing research focuses on effective influence maximization analysis to disseminate information widely, rather than explicitly incorporating pricing factors into th作者: Myosin 時(shí)間: 2025-3-24 17:32
Daniela Ciaffi,Emanuela Saporitocapacities, and positive vertex weights. A path can be considered as a road, an edge length as the distance along the road and a vertex weight as the number of people at the site. An edge capacity limits the number of people that can enter the edge per unit time. In the dynamic flow network, given p作者: Crepitus 時(shí)間: 2025-3-24 19:18 作者: BUDGE 時(shí)間: 2025-3-24 23:53 作者: 怎樣才咆哮 時(shí)間: 2025-3-25 06:53 作者: phlegm 時(shí)間: 2025-3-25 09:56
An Approximation of the Zero Error Capacity by a Greedy Algorithm a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.作者: Discrete 時(shí)間: 2025-3-25 12:15 作者: delegate 時(shí)間: 2025-3-25 17:29
978-3-030-64842-8Springer Nature Switzerland AG 2020作者: 糾纏,纏繞 時(shí)間: 2025-3-25 22:10 作者: 相反放置 時(shí)間: 2025-3-26 00:10 作者: 小口啜飲 時(shí)間: 2025-3-26 05:18
Sampling-Based Approximate Skyline Calculation on Big Datay small in most cases, and is almost independent of the input relation size. The second algorithm returns an .-approximation for the exact skyline. The size of sample required by the second algorithm can be regarded as a constant relative to the input relation size, so is the running time.作者: crutch 時(shí)間: 2025-3-26 12:03 作者: Barrister 時(shí)間: 2025-3-26 15:38 作者: 喊叫 時(shí)間: 2025-3-26 16:49
Swati Chauhan,Ojaswini Bansal,Anshul Puriyahas full theoretical guarantees. Furthermore, the query time of the algorithm is sub-linear. As far as we know, it is the first algorithm that achieves both sub-linear query time and full theoretical approximation guarantees.作者: GLIDE 時(shí)間: 2025-3-27 00:25
Technology-Enhanced Infrastructurens, and using warehouses as starting and ending points in parcel delivery. In this paper we define the UAS Energy-constrained Delivery Scheduling problem and propose a scheduling mechanism using a multi-source A* algorithm variant. Simulation results show that our algorithm is efficient and scalable with the number of requests and network size.作者: altruism 時(shí)間: 2025-3-27 02:01 作者: accessory 時(shí)間: 2025-3-27 06:24
Energy-Constrained Drone Delivery Schedulingns, and using warehouses as starting and ending points in parcel delivery. In this paper we define the UAS Energy-constrained Delivery Scheduling problem and propose a scheduling mechanism using a multi-source A* algorithm variant. Simulation results show that our algorithm is efficient and scalable with the number of requests and network size.作者: Palliation 時(shí)間: 2025-3-27 10:48 作者: 愛了嗎 時(shí)間: 2025-3-27 16:53
The Smart Grid: Anchor of the Smart City Satisfactory Partition problem is polynomial-time solvable for block graphs, (2) The Satisfactory Partition problem and its balanced version can be solved in polynomial time for graphs of bounded clicque-width, and (3) A generalized version of the Satisfactory Partition problem is W[1]-hard when parametrized by treewidth.作者: CAMP 時(shí)間: 2025-3-27 21:37
The Smart Grid: Anchor of the Smart City We prove that this PSP is strongly NP-hard even when restricted to unit processing times, a common period, and 16 machines, by a reduction from the job shop scheduling problem. Finally, we propose a local search heuristic to solve the general PSP and present its experimental evaluation.作者: 不容置疑 時(shí)間: 2025-3-28 00:32
The Smart Grid: Anchor of the Smart Citythe number of jobs to be scheduled and . is the length of the input’s longest precedence chain. We demonstrate that the algorithm is practical on realistic inputs, finds solutions that are close to optimal, and improves over existing algorithms on the data sets tested.作者: 骯臟 時(shí)間: 2025-3-28 04:00 作者: 潰爛 時(shí)間: 2025-3-28 09:49 作者: 厚臉皮 時(shí)間: 2025-3-28 10:45
On the Complexity of a Periodic Scheduling Problem with Precedence Relations We prove that this PSP is strongly NP-hard even when restricted to unit processing times, a common period, and 16 machines, by a reduction from the job shop scheduling problem. Finally, we propose a local search heuristic to solve the general PSP and present its experimental evaluation.作者: LAY 時(shí)間: 2025-3-28 17:21 作者: adhesive 時(shí)間: 2025-3-28 19:56 作者: 拖債 時(shí)間: 2025-3-29 00:46
Approximate Ridesharing of Personal Vehicles Problem all trips have the same earliest departure and same latest arrival time. It is known that both minimization problems are NP-hard if one of Conditions (1), (2) and (3) is not satisfied. We prove that both problems are NP-hard and further show that it is NP-hard to approximate both problems within a 作者: Infinitesimal 時(shí)間: 2025-3-29 07:01
Selecting Sources for Query Approximation with Bounded Resourcesalgorithms to solve the problems and devise a bitwise operation strategy to improve efficiency, along with rigorous theoretical guarantees on their performance. Experimental results on both real-world and synthetic data show high efficiency and scalability of our algorithms.作者: 母豬 時(shí)間: 2025-3-29 08:09
Reachability Games for Optimal Multi-agent Scheduling of Tasks with Variable Durationsing optimal schedules for astronauts aboard the International Space Station. Finally, experiments on randomly generated instances show that, on average, this technique is at least two orders of magnitude faster than an integer program formulation.作者: SCORE 時(shí)間: 2025-3-29 11:25 作者: GLUT 時(shí)間: 2025-3-29 16:05
Two-Stage Pricing Strategy with Price Discount in Online Social Networksa pricing model named Two-stage Pricing with Discount Model (TPDM). We propose that companies use two marketing methods: Advertisement Marketing (AM) and Word-of-mouth Marketing (WM). To achieve the goal of maximizing the profit of product companies, we propose a Two-stage with Discount Greedy Algor作者: ALIAS 時(shí)間: 2025-3-29 20:20
Almost Linear Time Algorithms for Minsum ,-Sink Problems on Dynamic Flow Path Networkst all the people at a vertex have to evacuate to the same sink, and in the latter model, there is no such restriction. In this paper, for both the models, we develop algorithms which run in almost linear time regardless of the number of sinks. It should be stressed that for the confluent flow model,作者: 的染料 時(shí)間: 2025-3-30 00:04
Matched Participants Maximization Based on Social Spreadrd and the computation of the target function is #P-hard, under both the NM and GM strategies. To solve MPM-NM efficiently, we propose a Matching Reachable Set method and a .-approximation algorithm. Sandwich method is used for solving MPM-GM by using the result of MPM-NM as a lower-bound and constr作者: 擴(kuò)張 時(shí)間: 2025-3-30 05:15 作者: epidermis 時(shí)間: 2025-3-30 10:44 作者: narcissism 時(shí)間: 2025-3-30 15:53 作者: 水獺 時(shí)間: 2025-3-30 18:00
Angelo Miglietta,Emanuele Parisius on the case of two machines and derive a strong, structural lower bound. This lower bound is based on a relaxed version and allows us to design an asymptotic 3/2-approximation that runs in time .. As an immediate consequence we also get an improved 9/4-approximation for the case of three machines作者: artifice 時(shí)間: 2025-3-31 00:28
Shared Administration for Smart Citiesa pricing model named Two-stage Pricing with Discount Model (TPDM). We propose that companies use two marketing methods: Advertisement Marketing (AM) and Word-of-mouth Marketing (WM). To achieve the goal of maximizing the profit of product companies, we propose a Two-stage with Discount Greedy Algor
