Keywords: No wait scheduling; total flow time; NP-hard; Combinatorial optimization; particle swarm optimization;
مقالات ISI (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: Connected dominating set; Disjoint connected dominating sets; NP-hard; Approximation algorithm;
Keywords: Energy-aware; Task assignment; Cloud computing; Mobile embedded systems; Cyber-enabled applications; NP-hard;
Keywords: Tree-decomposition; Treewidth; NP-hard;
Keywords: Flexible job shop; Multi-objective evolutionary algorithm; NP-hard; Optimization;
Keywords: Maximum weighted minimal dominating set (WUDS); NP-hard; inapproximability; planar bipartite; split graphs; UDS in regular graphs;
Keywords: Graph algorithms; Bipartition; Kernelization; NP-hard; Fixed-parameter tractable;
Keywords: Maximum weight clique; Exact algorithm; Branch-and-bound; Upper bound calculation; NP-hard;
Keywords: ABC; Artificial bee colony; AT; Automatic transmission; ANN; Artificial neural network; AWD; All wheel drive; BEV; Battery electric vehicle; CAFC; Corporate average fuel consumption; CAFE; Corporate average fuel economy; CVT; Continuous variable transmiss
Keywords: Scheduling; Unrelated parallel batch machines; NP-hard; Makespan; Heuristics;
Keywords: Data intensive computing; Scheduling; Makespan; NP-hard;
Keywords: Flow shop; Scheduling; NP-hard; Monkey search algorithm; Makespan; Total flow time;
Keywords: NP-hard; Boolean-width; Maximum induced matching-width; Branch decompositions;
Keywords: Minimum feedback arc set; Node ordering; Information system; Monte Carlo; Randomization; NP-hard; NP-complete; APX-hard
Keywords: Rescheduling; Rework jobs; Waiting time; Heuristic algorithm; NP-hard; Single machine
Keywords: Carbon emission allowance allocation; Air passenger transport; Cap and trade mechanism; Emission mitigation; ICAO; International Civil Aviation Organization; EUETS; European Union Emissions Trading Scheme; CEAAP; carbon emission allowance allocation probl
Keywords: (Weighted) restrained domination; NP-hard; Planar bipartite graphs; Cactus graphs
Keywords: Migration; Network Virtualization; Mapping; NP-hard; Optimization; ILP model
Keywords: Discrete sell or hold problem; NP-hard; Approximation algorithm
Keywords: Parallel batching machines; Coordinated production-delivery; Fixed time departure; NP-hard; Heuristics
Keywords: Parallel batch machines; Heuristic; Max-Min Ant System; NP-hard; Non-identical machine capacity; Makespan;
Keywords: Preemptive scheduling; Identical machines; Delivery coordination; NP-hard; Approximation algorithm
Keywords: Two dimensional load balancing; Makespan; Maximum machine cost; Parallel machines; NP-hard; Heuristics
Keywords: Genome comparison; Adjacency; Breakpoint; NP-hard; Approximation algorithm
Keywords: Uniform machines; Intelligent scheduling; Total completion time; Release dates; NP-hard; Heuristics;
Keywords: Hybrid flow shop (HFS); Scheduling; NP-hard; Improved cuckoo search (ICS); Metaheuristics
Keywords: Liner shipping network design; Transit time; NP-hard; Column generation;
Keywords: Meta-heuristic; Batch machines; Max–min ant system; NP-hard
Keywords: Automata networks; Threshold functions; Computational complexity; Updating scheme; P-completeness; NC; NP-Hard
Keywords: Batch machines; Makespan; NP-hard; Approximation algorithm; Absolute worst-case ratio; Asymptotic worst-case ratio;
Keywords: Scheduling; Traveling Tournament Problem; NP-hard
Keywords: Community-less nodes; Graph co-clustering; MOEA/D; Non-dominated solution; NP-hard; Social networks
Improved kernel results for some FPT problems based on simple observations
Keywords: Fixed-parameter tractability; NP-hard; Kernelization;
Flowshop problem F2 â D|v = 1,c â¥Â 1|Cmax revisited
Keywords: Flow shop problems; NP-hard; Complexity;
The real nonnegative inverse eigenvalue problem is NP-hard
Keywords: 15A18; 15A29; 90C60; 68Q25; Nonnegative matrix; Inverse eigenvalue problem; Decision problem; P; NP; NP-hard; NP-complete;
An exact algorithm for Min-Max hyperstructure equipartition with a connected constraint
Keywords: Hyperstructure equipartition; NP-Hard; Minimax programming; Connected constraint; Balanced constraint; Rapid transit network;
Identification of SNP-SNP interaction for chronic dialysis patients
Keywords: SNPs; single nucleotide polymorphisms; D-loops; displacement loops; DCPSO-KNN; dynamic center particle swarm optimization k-nearest neighbors; K-NN; k-nearest neighbors; PPV; positive predictive value; NPV; negative predictive value; OR; odds ratio; 95% C
An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families
Keywords: Parallel batch machines; Max-Min Ant System; NP-hard; Incompatible job families; Makespan;
Genetic algorithm approach for k-coverage and m-connected node placement in target based wireless sensor networks
Keywords: Wireless sensor networks; k-coverage; m-connectivity; Node deployment; NP-hard; Genetic algorithm;
Approximation algorithms for clique transversals on some graph classes
Keywords: Approximation algorithms; Clique transversal; Graph classes; NP-hard
A time and space complexity reduction for coevolutionary analysis of trees generated under both a Yule and Uniform model
Keywords: Coevolution; Phylogeny; Tree topology; NP-Hard;
A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
Keywords: Meta-heuristic; Parallel batch machines; Max-min ant system; NP-hard;
Two-machine no-wait flowshop scheduling with learning effect and convex resource-dependent processing times
Keywords: Flowshop scheduling; No-wait; Learning effect; Resource allocation; NP-hard
Is the Protein Model Assignment problem under linked branch lengths NP-hard?
Keywords: NP-hard; Model selection; Phylogenetics; Maximum likelihood; Phylogenomics;
Mechanical linkage design and NP-hardness
Keywords: Dimensioning; Assembly; Mobility; Algorithmic complexity; NP-hard
A note on approximating the bb-chromatic number
Keywords: bb-coloring; bb-chromatic number; Approximation; NP-hard
Single-machine scheduling problems with actual time-dependent and job-dependent learning effect
Keywords: Scheduling; Learning effect; Actual time-dependent; Job-dependent; NP-hard
Complexity of the path avoiding forbidden pairs problem revisited
Keywords: Path; Forbidden pair; NP-hard; Dynamic programming
Bridging the gap between theory and practice of approximate Bayesian inference
Keywords: Bayesian inference; Approximation; NP-hard; Parameterized complexity theory; Algorithms; Computational explanation
Broadcasting on-demand data with time constraints using multiple channels in wireless broadcast environments
Keywords: On-demand data broadcasting; Data overlapping; NP-hard; Competitive analysis; Latency; Miss rate