272 results on '"COMPUTATIONAL complexity"'
Search Results
2. A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
3. On the local dominance properties in single machine scheduling problems
4. Subexponential-Time Algorithms for Sparse PCA
5. Analysis of BURA and BURA-based approximations of fractional powers of sparse SPD matrices
6. Computational thinking through the lens of biological evolution learning: enhancing understanding through the levels of biological organization and computational complexity
7. An improved composite ship magnetic field model with ellipsoid and magnetic dipole arrays
8. Pseudospectral Shattering, the Sign Function, and Diagonalization in Nearly Matrix Multiplication Time
9. On Time–Frequency Domain Flexible Structure of Delayless Partitioned Block Adaptive Filtering Approach for Active Noise Control
10. An Incentive-Compatible and Computationally Efficient Fog Bargaining Mechanism
11. A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints
12. A Complete Complexity Dichotomy of the Edge-Coloring Problem for All Sets of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$8$$\end{document}-Edge Forbidden Subgraphs
13. An effective global algorithm for worst-case linear optimization under polyhedral uncertainty
14. A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work
15. On the Computational Complexity of Compressed Power Series
16. A survey on filtered-x least mean square-based active noise control systems with emphasis on reducing computational complexity
17. RUBic: rapid unsupervised biclustering
18. Improved lower bound for the complexity of unique shortest vector problem
19. Hardness of candidate nomination
20. Algorithms for partially robust team formation
21. Scheduling Problem for Call Center Operators
22. The smallest hard trees
23. The Quantum Density Matrix and Its Many Uses: From Quantum Structure to Quantum Chaos and Noisy Simulators
24. Quantum algorithm of Dempster rule of combination
25. On a Countable Family of Boundary Graph Classes for the Dominating Set Problem
26. Misinformation influence minimization by entity protection on multi-social networks
27. Topology-based UAV path planning for multi-view stereo 3D reconstruction of complex structures
28. A distributed gradient algorithm based on randomized block-coordinate and projection-free over networks
29. A note on the complexity of the bilevel bottleneck assignment problem
30. Deciding the feasibility of a booking in the European gas market is coNP-hard
31. Vandermonde Varieties, Mirrored Spaces, and the Cohomology of Symmetric Semi-algebraic Sets
32. Egalitarian judgment aggregation
33. Reduced complexity and optimized face recognition approach based on facial symmetry
34. On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements
35. In memoriam Gerhard Woeginger
36. Algebraic Machine Learning: Emphasis on Efficiency
37. Computing the Sound of the Sea in a Seashell
38. Approximation issues of fractional knapsack with penalties: a note
39. Some Cases of Polynomial Solvability of the Edge Coloring Problem That Are Generated by Forbidden 8-Edge Subcubic Forests
40. Single-machine scheduling with resource-dependent processing times and multiple unavailability periods
41. An optimized hardware design of a two-dimensional guide filter and its application in image denoising
42. A precision detection technique for power disturbance in electrical system
43. Computing the execution probability of jobs with replication in mixed-criticality schedules
44. Scheduling divisible loads with time and cost constraints
45. A note on the complexity of two supply chain scheduling problems
46. A high speed roller dung beetles clustering algorithm and its architecture for real-time image segmentation
47. Unravelling multi-agent ranked delegations
48. The transportation problem with conflicts
49. Efficient Solvability of the Weighted Vertex Coloring Problem for Some Two Hereditary Graph Classes
50. The Extended Feature LMS Algorithm: Exploiting Hidden Sparsity for Systems with Unknown Spectrum
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.