Keywords: NP-سخت مشکلات; Jumping finite automata; Shuffle expressions; Commutative languages; Semilinear sets; NP-hard problems; Exponential time hypothesis;
مقالات ISI NP-سخت مشکلات (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: NP-سخت مشکلات; Meta-heuristics; NP-hard problems; Mobile Anchor Positioning; Bat Optimization Algorithm; Modified Cuckoo Search; Firefly Optimization Algorithm
Keywords: NP-سخت مشکلات; NP-hard problems; Fixed-parameter algorithms; One-player game
Keywords: NP-سخت مشکلات; Sensor network localization; Canonical duality theory; Perturbation method; Global optimization; NP-Hard problems
Revisiting Shinohara's algorithm for computing descriptive patterns
Keywords: NP-سخت مشکلات; Pattern languages; Inductive inference; Descriptive patterns; NP-hard problems;
Design partitioning and layer assignment for 3D integrated circuits using tabu search and simulated annealing
Keywords: NP-سخت مشکلات; Through-silicon via (TSV); 3D integrated circuits (3D ICs); Iterative heuristics; Tabu search; Simulated annealing; Combinatorial optimization; Multi-way partitioning; NP-hard problems
A general resolution of intractable problems in polynomial time through DNA Computing
Keywords: NP-سخت مشکلات; DNA Computing; NP-Hard problems; Co-NP class;
Approximability and parameterized complexity of multicover by c-intervals
Keywords: NP-سخت مشکلات; Algorithms; NP-hard problems; APX-hardness; Fixed-parameter tractability; W[1]-hardness; Set cover
Homological reconstruction and simplification in R3R3
Keywords: NP-سخت مشکلات; NP-hard problems; Homology; Persistence
Number of holes in unavoidable sets of partial words II
Keywords: NP-سخت مشکلات; Automata and formal languages; Computational complexity; Combinatorics on words; Partial words; Unavoidable sets; NP-hard problems
A new polynomial time algorithm for 0–1 multiple knapsack problem based on dominant principles
Keywords: NP-سخت مشکلات; 0–1 Multi-constrained knapsack problem; Heuristic; Computational complexity; NP-hard problems
Tolerance-based Branch and Bound algorithms for the ATSP
Keywords: NP-سخت مشکلات; Tolerances; NP-hard problems; Branch and Bound
NONSMOOTH STRUCTURED CONTROL DESIGN
Keywords: NP-سخت مشکلات; Nonsmooth optimization; H∞ synthesis; structured controllers; PID; NP-hard problems
A hybrid system for multiobjective problems – A case study in NP-hard problems
Keywords: NP-سخت مشکلات; Multiobjective decision making; Hybrid systems; Fuzzy inferencing methods; Neural networks; NP-hard problems
Exact algorithms and applications for Tree-like Weighted Set Cover
Keywords: NP-سخت مشکلات; NP-hard problems; (Weighted) Set Cover; Multicut in trees; Minimum Weighted Edge Cover on acyclic hypergraphs; Fixed-parameter tractability
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
Keywords: NP-سخت مشکلات; Approximation algorithms; NP-hard problems; Partial k-trees; Bounded treewidth;
Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing
Keywords: NP-سخت مشکلات; Molecular computing; DNA-based computing; NP-complete problems; NP-hard problems; Vertex-cover problem; Cook's Theorem.;
On the relation between equations with max-product composition and the covering problem
Keywords: NP-سخت مشکلات; Fuzzy relations; Fuzzy relation equations; Inverse problem; Max-product composition; Minimal solutions; Covering problem; NP-hard problems; NP-complete problems;
A user-friendly marketing decision support system for the product line design using evolutionary algorithms
Keywords: NP-سخت مشکلات; Marketing decision support systems; Product line design; Evolutionary algorithms; Heuristic methods; NP-hard problems;