NP-Hard - Globe Thesis - Globe Thesis

Keyword [NP-Hard] Result: 41 - 60 \| Page: 3 of 5
41.	Reasearching On High Performance Algorithms For Packing Unequal Spheres And Disks
42.	Research On Parameterized Algorithms For Several NP-hard Problems In Wireless Networks
43.	A Time-mode Assignment Problem For The Project Management
44.	Research On The Vehicle Routing Problem With Simultaneous Pickup And Delivery And Uncertain Information
45.	Study On Job-Shop Scheduling Algorithm Of MES
46.	The Research Of Broadcast Problem For Wireless Sensor Networks
47.	A Greedy Algorithm For Solving Scheduling Problem Based On Two-dimensional Rectangular Packing
48.	Study On Particle Swarm Optimization Algorithm For Multiple Application Scenarios
49.	Research On Optimization Methods For Rescheduling New Jobs Constrained By Adjustable Original Schedule
50.	An Algorithmic Study On Two Kinds Of Covering Problems In The WSN
51.	Timetable Design Base On Improvement Adaptive Genetic Algorithm
52.	Researches On DVFS-based Task Scheduling Problem In Data Centers
53.	Tabu Search Based GRASP Algorithm For The Vertex P-center Problem
54.	Research On Efficient Keyword-aware Optimal Route Query Processing Method
55.	Research On Privacy Protection Algorithms In Wireless Networks
56.	Kernelization For NP-hard Problems On Graphs With Small Distance Property
57.	Modified Particle Swarm Optimization-based Network Optimization
58.	Research On Wireless Sensor Two-layer Network Limited Relay Node Placement Algorithm
59.	A Research On The Meta-Heuristics For The Optimizations On Optical Networks
60.	The Algorithms For The 2D Rectangle Packing Problem And The VLSI Floorplanning Problem
<<First <Prev Next> Last>> Jump to