X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (1773) 1773
Conference Proceeding (1366) 1366
Publication (85) 85
Dissertation (57) 57
Book Chapter (39) 39
Book / eBook (4) 4
Book Review (4) 4
Government Document (4) 4
Paper (3) 3
Magazine Article (2) 2
Reference (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
np-hard problem (1384) 1384
np-hard (1213) 1213
algorithms (669) 669
computer science (458) 458
optimization (435) 435
genetic algorithms (295) 295
engineering, electrical & electronic (279) 279
mathematics, applied (259) 259
polynomials (252) 252
np-hard problems (235) 235
approximation algorithms (234) 234
studies (233) 233
algorithm design and analysis (232) 232
heuristic algorithms (208) 208
scheduling (205) 205
computer science, theory & methods (202) 202
computational complexity (198) 198
operations research & management science (197) 197
mathematics (187) 187
complexity (178) 178
analysis (167) 167
routing (166) 166
genetic algorithm (165) 165
costs (155) 155
mathematical models (154) 154
computer science, information systems (144) 144
approximation (140) 140
heuristic (139) 139
mathematical analysis (138) 138
algorithm (133) 133
processor scheduling (130) 130
computer science, artificial intelligence (125) 125
networks (123) 123
simulated annealing (122) 122
computer science, hardware & architecture (117) 117
graphs (117) 117
computer science, interdisciplinary applications (112) 112
computer networks (107) 107
testing (105) 105
telecommunications (104) 104
approximation algorithm (103) 103
linear programming (101) 101
artificial intelligence (100) 100
ant colony optimization (99) 99
scheduling algorithm (99) 99
research (98) 98
computer science, software engineering (93) 93
computational modeling (88) 88
job shop scheduling (85) 85
dynamic programming (83) 83
heuristics (83) 83
combinatorial optimization (82) 82
operations research (82) 82
usage (82) 82
computation (81) 81
computer simulation (80) 80
optimization methods (80) 80
partitioning algorithms (79) 79
graph theory (78) 78
theory of computation (76) 76
educational institutions (73) 73
cost function (71) 71
systems (69) 69
particle swarm optimization (68) 68
production scheduling (68) 68
resource management (68) 68
evolutionary computation (67) 67
robustness (66) 66
traveling salesman problems (66) 66
automation & control systems (64) 64
delay (64) 64
wireless sensor networks (64) 64
application software (61) 61
np hard (59) 59
vehicles (59) 59
very large scale integration (59) 59
data mining (58) 58
complexity theory (57) 57
makespan (55) 55
mathematical optimization (55) 55
stochastic processes (55) 55
traveling salesman problem (55) 55
cities and towns (53) 53
electronic mail (53) 53
methods (52) 52
neural networks (52) 52
clustering algorithms (51) 51
convergence (51) 51
genetic mutations (51) 51
integer programming (51) 51
network topology (51) 51
operations research/decision theory (51) 51
mathematical model (50) 50
berechnungskomplexität (49) 49
searching (48) 48
energy consumption (47) 47
trees (47) 47
wireless networks (47) 47
iterative algorithms (46) 46
theoretical computer science (46) 46
more...
Library Location Library Location
Language Language
Language Language
X
Sort by Item Count (A-Z)
Filter by Count
English (3018) 3018
Chinese (32) 32
Japanese (29) 29
Spanish (6) 6
Korean (2) 2
Portuguese (2) 2
French (1) 1
German (1) 1
Indonesian (1) 1
Polish (1) 1
Russian (1) 1
more...
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Theoretical Computer Science, ISSN 0304-3975, 03/2017, Volume 670, pp. 79 - 85
In this paper we study a flow shop problem with two machines and one transporter: machines and a transporter which is initially located at machine . There are... 
NP-hard | Flow shop problems | Complexity
Journal Article
SIAM Journal on Optimization, ISSN 1052-6234, 2009, Volume 20, Issue 3, pp. 1364 - 1377
Journal Article
Computational Geometry: Theory and Applications, ISSN 0925-7721, 06/2015, Volume 48, Issue 8, pp. 606 - 621
We consider the problem of deciding whether the persistent homology group of a simplicial pair (K,L) can be realized as the homology H∗(X) of some complex X... 
Persistence | NP-hard problems | Homology
Journal Article
Operations Research, ISSN 0030-364X, 06/2019
Journal Article
Journal Article
IEICE Transactions on Information and Systems, ISSN 0916-8532, 2016, Volume E99.D, Issue 3, pp. 607 - 614
A Manhattan tower is a monotone orthogonal polyhedron lying in the halfspace z ≥ 0 such that (i) its intersection with the xy-plane is a simply connected... 
Manhattan towers | guarding problem | NP-hard | Guarding problem
Journal Article
Journal Article
Applied Soft Computing Journal, ISSN 1568-4946, 06/2014, Volume 19, pp. 93 - 101
The multistage hybrid flow shop (HFS) scheduling problems are considered in this paper. Hybrid flowshop scheduling problems were proved to be NP-hard. A... 
NP-hard | Scheduling | Improved cuckoo search (ICS) | Metaheuristics | Hybrid flow shop (HFS) | BRANCH | FLOWSHOPS | HEURISTICS | COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE | GENETIC ALGORITHM | PARTICLE SWARM OPTIMIZATION | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | BOUND ALGORITHM | 2-STAGE | MULTIPLE PROCESSORS | Algorithms
Journal Article
BioSystems, ISSN 0303-2647, 10/2019, Volume 184, pp. 103997 - 103997
DNA computing, as one of potential means to solve complicated computational problems, is a new field of interdisciplinary research, including computational... 
Adleman–Lipton model | Capacitated vehicle routing problem | NP-hard problem | DNA computing | Index Medicus
Journal Article
Leibniz International Proceedings in Informatics, LIPIcs, ISSN 1868-8969, 06/2018, Volume 99, pp. 131 - 1315
Conference Proceeding
Journal of Machine Learning Research, ISSN 1532-4435, 10/2004, Volume 5, pp. 1287 - 1330
In this paper, we provide new complexity results for algorithms that learn discrete-variable Bayesian networks from data. Our results apply whenever the... 
NP-hard | Learning bayesian networks | Search complexity | Large-sample data | NP-Hard | large-sample data | search complexity | learning Bayesian networks | AUTOMATION & CONTROL SYSTEMS | COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Journal Article
Proceedings of the twenty-ninth annual symposium on computational geometry, 06/2013, pp. 117 - 126
We consider the problem of deciding whether the persistent homology group of a simplicial pair (K,L) can be realized as the homology of some complex H * (X)... 
NP-hard problems | persistence | homology
Conference Proceeding
Mathematics of Computation of the American Mathematical Society, ISSN 0025-5718, 05/2018, Volume 87, Issue 311, pp. 1255 - 1281
We establish several mathematical and computational properties of the nuclear norm for higher-order tensors. We show that like tensor rank, tensor nuclear norm... 
NP-hard | Nuclear decomposition | Tensor rank | Dual norm | Nuclear rank | Tensor nuclear norm | Tensor spectral norm | MATHEMATICS, APPLIED | nuclear rank | dual norm | tensor spectral norm | nuclear decomposition | APPROXIMATION | RANK | tensor rank
Journal Article
2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), ISSN 1063-6919, 06/2015, Volume 7-12-, pp. 4091 - 4099
Data association is the backbone to many multiple object tracking (MOT) methods. In this paper we formulate data association as a Generalized Maximum Multi... 
Target tracking | NP-hard problem | Image edge detection | Computational modeling | Object tracking | Optimization | Multiple target tracking | Computer vision | Simplification | Tracking | Conferences | Mathematical models | Pattern recognition
Conference Proceeding
Information Processing Letters, ISSN 0020-0190, 05/2019, Volume 145, pp. 6 - 10
We show that the Puzzle, a side-viewed 2-dimensional combinatorial puzzle with gravity and colored blocks, is -hard. 
Hanano Puzzle | NP-hard | Combinatorial puzzles | Computational complexity | COMPUTER SCIENCE, INFORMATION SYSTEMS
Journal Article
Indian Journal of Science and Technology, ISSN 0974-6846, 2016, Volume 9, Issue 22
Journal Article
SIAM JOURNAL ON OPTIMIZATION, ISSN 1052-6234, 2009, Volume 20, Issue 3, pp. 1364 - 1377
Nonnegative matrix factorization (NMF) has become a prominent technique for the analysis of image databases, text databases, and other information retrieval... 
feature detection | complexity | MATHEMATICS, APPLIED | NP-hard | data mining | nonnegative rank | nonnegative matrix factorization | Studies | Mathematical problems | Complexity theory | Data bases | Heuristic | Databases | Equivalence | Images | Information retrieval | Texts | Factorization | Combinatorial analysis | Optimization
Journal Article
Ruan Jian Xue Bao/Journal of Software, ISSN 1000-9825, 09/2016, Volume 27, Issue 9, pp. 2218 - 2229
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.