Essays about: "Constraint Solving Problems"
Showing result 1 - 5 of 30 essays containing the words Constraint Solving Problems.
-
1. A Bayesian Bee Colony Algorithm for Hyperparameter Tuning of Stochastic SNNs : A design, development, and proposal of a stochastic spiking neural network and associated tuner
University essay from Uppsala universitet/Signaler och systemAbstract : With the world experiencing a rapid increase in the number of cloud devices, continuing to ensure high-quality connections requires a reimagining of cloud. One proponent, edge computing, consists of many distributed and close-to-consumer edge servers that are hired by the service providers. READ MORE
-
2. Adjoint optimization of a liquid-cooled heat sink
University essay from KTH/Teknisk mekanikAbstract : Improving the design of flow channels in a liquid-cooled heat sink is critical for boosting the capabilities of electronic components as well as reducing energy usage by the pump. This work explores the use of topology optimization to minimize the pressure difference across a heat sink and consequently, the energy used to supply the liquid. READ MORE
-
3. Contributions to a New CBLS Backend for MiniZinc
University essay from Uppsala universitet/Institutionen för informationsteknologiAbstract : MiniZinc is a language which enables the modelling of combinatorial optimisation and satisfaction problems independently from any particular problem solver and its technology. One technology for solving combinatorial optimisation and satisfaction problems is constraint-based local search (CBLS). READ MORE
-
4. Recording and Minimising Nogoods from Restarts in the Solver MiniCP
University essay from Uppsala universitet/Institutionen för informationsteknologiAbstract : Systematic search is a typical search algorithm in Constraint Programming. The solving performance of this search algorithm is affected by the heavy-tailed phenomenon, which can cause search to spend significant time exploring subtrees that contain no solutions to the problem instance. READ MORE
-
5. Invariant Propagation for Solvers of Constraint-Based Local Search Technology
University essay from Uppsala universitet/Institutionen för informationsteknologiAbstract : Constraint-based local search is a technology for solving constrained optimisation problems and constraint satisfaction problems. Solvers of this kind rely on the notion of invariants and an invariant propagation algorithm during search. READ MORE