278 results on '"COMPUTATIONAL complexity"'
Search Results
2. FINDING A LARGE SUBMATRIX OF A GAUSSIAN RANDOM MATRIX
3. Single Machine Scheduling with Time Deteriorating Job Values
4. The Complexity of Propositional Proofs
5. Heuristics for a Coupled-Operation Scheduling Problem
6. Lower Bounds and Stochastic Optimization Algorithms for Uniform Designs with Three or Four Levels
7. A Simple Proof That Optimality Theory Is Computationally Intractable
8. Hard-to-Solve Bimatrix Games
9. Generating Ranking Groups in the Analytical Hierarchy Process
10. Single-Machine Scheduling with Time Window-Dependent Processing Times
11. Heterogeneous Multiscale Methods for Stiff Ordinary Differential Equations
12. The Complexity of Exchange
13. The Expected Number of Nash Equilibria of a Normal Form Game
14. The Complexity of the Word-Problem for Finite Matrix Rings
15. Likelihood Estimation and Inference in a Class of Nonregular Econometric Models
16. Epistemic Virtues, Metavirtues, and Computational Complexity
17. Confidence Bands for Isotonic Median Curves Using Sign Tests
18. Scheduling Jobs with Position-Dependent Processing Times
19. Adaptive Solution of Operator Equations Using Wavelet Frames
20. Adaptive Wavelet Schemes for Nonlinear Variational Problems
21. Multiple Number and Letter Comparison: Directionality and Accessibility in Numeric and Alphabetic Memories
22. Combinatorial Auction Design
23. Economic Optimization in a Fixed Sequence of Unreliable Inspections
24. Matching Games: The Least Core and the Nucleolus
25. Batch Scheduling with Controllable Setup and Processing Times to Minimize Total Completion Time
26. On an EOQ Model for Deteriorating Items with Time-Varying Demand and Partial Backlogging
27. The Complexity of Generic Primal Algorithms for Solving General Integer Programs
28. The Complexity of Decentralized Control of Markov Decision Processes
29. A Recovering Beam Search Algorithm for the One-Machine Dynamic Total Completion Time Scheduling Problem
30. Computational Complexity and Communication: Coordination in Two-Player Games
31. A Fast Spherical Harmonics Transform Algorithm
32. A New "Feasible" Arithmetic
33. Fixed Point Logics
34. Filtering the Feynman-Kac Formula
35. Is There a Curse of Dimensionality for Contraction Fixed Points in the Worst Case?
36. Some Interesting Connections between the Slow Growing Hierarchy and the Ackermann Function
37. Minimizing Total Completion Time in a No-Wait Flowshop with Sequence-Dependent Additive Changeover Times
38. The Number of Reidemeister Moves Needed for Unknotting
39. Revolution, Discovery, and an Elementary Principle of Logic
40. Bicriteria Optimisation of the Makespan and Mean Flowtime on Two Identical Parallel Machines
41. Irreducibility Testing Over Local Fields
42. The Complexity of Optimal Small Policies
43. A Fast and Accurate Multilevel Inversion of the Radon Transform
44. A Cluster Insertion Heuristic for Single and Multiple Depot Vehicle Routing Problems with Backhauling
45. Massive Datasets Workshop: Four Years after
46. The Fundamental Matrix of Singularly Perturbed Markov Chains
47. On the Complexity of Verifying Structural Properties of Discrete Event Simulation Models
48. The Complexity of Optimal Queuing Network Control
49. Phase Transitions in Project Scheduling
50. Approximately Exact Inference for the Common Odds Ration in Several 2 × 2 Tables: Comment
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.