4 075 uppsatser · sida 28 av 60
… illness is a lengthy process that gives rise to both physical and psychical problems. These problems might lead to a state of burn out. However, several authors prefer to use expressions like exhaust syndrome or exhaust depression as they are criticising the concept of burn out …
… environmental politics began to enter the fishery politic. The environmental problems in the Baltic Sea were given attention and it was a great anxiety over the eutrophication. In the 1980: s the codpopulation declined and with them the catches declined. The conflict over the …
en kvalitativ studie
… i mötet med klienter som söker försörjningsstöd. Den övergripande problemställningen har varit: Hur kan man förstå och beskriva socialsekreterarens handlingsutrymme i mötet med klienter som söker försörjningsstöd. För att kunna besvara problemställningen och nå syftet med …
en problemskola!
… har sedan början av ?90 talet år tillbaka varit att betrakta som en problemskola. Oro, skadegörelse och våld har kommit och gått i vågor. Så vad kan man göra åt problemet. Kan man genom en djupare förståelse av bakomliggande faktorer arbeta mer effektivt mot det beteende som …
Heat, clock scew and frequency optimization are some of the problems a semiconductor designer must face. By splitting a synchrounous block into multiple pieces which comunicates asynchronously with eachother and provide them with independent clocks, these problems may be …
The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape …
The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape …
The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape …
The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape …
Vattenfall Eldistribution AB
The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape …
The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape …
The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape …
The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape …
The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape …
The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape …
