273 uppsatser · sida 2 av 19
… of one month were analyzed, results examined and statistically evaluated. An algorithm for calculating voltage sag characteristics and indices was created in Matlab. Algorithm detects if the event is voltage sag, interruption or swell. Two different methods, symmetrical …
… of one month were analyzed, results examined and statistically evaluated. An algorithm for calculating voltage sag characteristics and indices was created in Matlab. Algorithm detects if the event is voltage sag, interruption or swell. Two different methods, symmetrical …
… of one month were analyzed, results examined and statistically evaluated. An algorithm for calculating voltage sag characteristics and indices was created in Matlab. Algorithm detects if the event is voltage sag, interruption or swell. Two different methods, symmetrical …
… of one month were analyzed, results examined and statistically evaluated. An algorithm for calculating voltage sag characteristics and indices was created in Matlab. Algorithm detects if the event is voltage sag, interruption or swell. Two different methods, symmetrical …
… of one month were analyzed, results examined and statistically evaluated. An algorithm for calculating voltage sag characteristics and indices was created in Matlab. Algorithm detects if the event is voltage sag, interruption or swell. Two different methods, symmetrical …
… handle transient overloads effectively. The goal of this work is to develop an algorithm that would provide a robust and controlled behavior of the video system so that important data is delivered on time to the video clients. In order to address this problem, we propose a …
… for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent …
… for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent …
… for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent …
… for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent …
Vattenfall Eldistribution AB
… for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent …
… for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent …
… for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent …
… for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent …
… for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent …
