Scheduling with neural networks -- the case of the Hubble Space Telescope
From MaRDI portal
Publication:1200817
DOI10.1016/0305-0548(92)90045-7zbMath0825.90654OpenAlexW2061057643MaRDI QIDQ1200817
Publication date: 16 January 1993
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(92)90045-7
Deterministic scheduling theory in operations research (90B35) Neural networks for/in biological studies, artificial life and related topics (92B20) Case-oriented studies in operations research (90B90) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Metaheuristics: A bibliography, Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems, A neural network model for scheduling problems, A Lagrangian reconstruction of GENET
Uses Software
Cites Work
- Maintaining knowledge about temporal intervals
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- ``Neural computation of decisions in optimization problems
- On the stability of the travelling salesman problem algorithm of Hopfield and Tank
- Network-based heuristics for constraint-satisfaction problems
- Simulated annealing with noisy or imprecise energy measurements
- Probabilistic algorithm for testing primality
- NP-complete scheduling problems
- Consistency in networks of relations
- Collective Computation With Continuous Variables
- Combining functions for certainty degrees in consulting systems
- Combinatorics, complexity, and randomness
- Scheduling coupled tasks
- On the Computational Complexity of Combinatorial Problems
- A Fast Monte-Carlo Test for Primality
- Neural networks and physical systems with emergent collective computational abilities.
- Neurons with graded response have collective computational properties like those of two-state neurons.
- Probability, Frequency and Reasonable Expectation
- The NP-completeness column: An ongoing guide
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
