NP-hard - Globe Thesis - Globe Thesis

Keyword [NP-hard] Result: 1 - 20 \| Page: 1 of 5
1.	On The Heuristic Algorithms For Resource Optimization Problems
2.	The Research On The Model And Algorithm Of Bandwidth Measurement In IP Network
3.	Research On Some Routing Related Problems In Wireless Sensor Networks
4.	A Hybrid Local Search Algorithm For Job Shop Scheduling Problem
5.	Research On Parameterized Models And Algorithms For The Haplotype Assembly Problem
6.	Pure Quasi-human Algorithms For Solving The Rectangle Packing Problem
7.	Quasi-Physical Quasi-Human Algorithm For Protein Folding
8.	Research On Parameterized Algorithms For Several NP-hard Problems
9.	Research On Several Issues In Ant Colony Optimization Approach
10.	Research On Parameterized Algorithms For Packing And Matching Problems
11.	Feasible Approaches For Solving The Arbitrary Sized Circle Packing Problem
12.	The Heuristic Research For The Equal Sphere Packing Problem
13.	Time Varying Network Chinese Postman Problem:Integer Programming Formulations And Algorithms
14.	Heuristic Algorithms For The Circle Packing Problem And The Cluster Structure Optimization Problem
15.	Practical Approach To Structure Prediction Of Atomic Clusters-High-Performance Heuristic Algorithms
16.	Precision Push Algorithm For The Quadratic Assignment Problem
17.	Research On A Parameterized Algorithm For The Haplotype Assembly Problem Weighted Minimum Letter Flips
18.	A Quasi-Physical-Society Algorithm For Solving Congruent Circles Packing Problem
19.	Maximum Caving Degree Algorithm For Solving Cuboids Packing Problem
20.	Research On Heuristic Algorithm For Graph Coloring Problem
<<First <Prev Next> Last>> Jump to