Sökning: "solution neighbourhood"

Visar resultat 1 - 5 av 13 avhandlingar innehållade orden solution neighbourhood.

  1. 1. Att ordna staden : Den nya storstadspolitiken växer fram

    Författare :Susanne Urban; Sven E O Hort; Mats Franzén; Stockholms universitet; []
    Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; town planning; urban sociology; neighbourhood; planning ideal; publicity; ethnic housing segregation; integration; public realm; Jürgen Habermas; social problems; participation; metropolitan policy; integration policy; Samhällsplanering; urbansociologi; grannskap; planeringsideal; offentlighet; etnisk bostadssegregation; integration; offentlig sfär; Jürgen Habermas; samhällsproblem; delaktighet; storstadspolitik; integrationspolitik; Huddinge; Sociology; Sociologi; SOCIAL SCIENCES;

    Sammanfattning : The sociology of the city has two faces: one of threat and one of promises. Originally, the city was portrayed as a threat to social life and individual identity, while, in contrast, the neighbourhood was seen to include the promise of restoring basic social relations to the web of city life. LÄS MER

  3. 2. Constraints for Membership in Formal Languages under Systematic Search and Stochastic Local Search

    Författare :Jun He; Pierre Flener; Justin Pearson; Yves Deville; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; constraint programming; regular constraint; automaton constraint; context-free grammar constraint; solution neighbourhood; counter automaton; Datavetenskap; Computer Science;

    Sammanfattning : This thesis focuses on constraints for membership in formal languages under both the systematic search and stochastic local search approaches to constraint programming (CP). Such constraints are very useful in CP for the following three reasons: They provide a powerful tool for user-level extensibility of CP languages. LÄS MER

  4. 3. On Methods for Discrete Topology Optimization of Continuum Structures

    Författare :Mats Werme; Krister Svanberg; Wolfgang Achtziger; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Topology optimization; Stress constraints; Sensitivity calculations; Neighbourhood search methods; Sequential integer programming; Optimization; systems theory; Optimeringslära; systemteori;

    Sammanfattning : This thesis consists of an introduction and seven appended papers. The purpose of the introduction is to give an overview of the field of topology optimization of discretized load carrying continuum structures. LÄS MER

  5. 4. Yesterday once more? Unemployment and health inequalities across the life course in northern Sweden

    Författare :Anna Brydsten; Miguel San Sebastian; Anne Hammarström; Mattias Strandh; Per-Olof Östergren; Umeå universitet; []
    Nyckelord :MEDICIN OCH HÄLSOVETENSKAP; MEDICAL AND HEALTH SCIENCES; unemployment; life course; long-term health consequences; health inequity; national unemployment rates; neighbourhood unemployment rates; northern Sweden; arbetslöshet; livslopp; långsiktiga hälsokonsekvenser; ojämlikhet i hälsa; nationella arbetslöshet; arbetslöshet i bostadsområdet; norra Sverige; folkhälsa; Public health; Epidemiology; epidemiologi; socialmedicin; Social Medicine;

    Sammanfattning : AbstractBackground. It is relatively well established in previous research that unemployment has direct health consequences in terms of mental and physical ill health. Recently, knowledge has emerged indicating that unemployment can lead to economic consequences that remain long after re-establishment in the labour market. LÄS MER

  7. 5. From Declarative Models to Local Search

    Författare :Gustav Björdal; Pierre Flener; Justin Pearson; Laurent Michel; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; discrete optimisation; combinatorial optimisation; local search; large-neighbourhood search; MiniZinc; constraint programming; declarative modelling; declarative neighbourhoods; Computer Science; Datavetenskap;

    Sammanfattning : A solver is a general-purpose software for solving optimisation problems. It takes as input a description of a problem, called a model, and uses a collection of algorithms, called its solving technology, to ideally produce an optimal solution as output. Most solvers have a modelling language that cannot be processed by other solvers. LÄS MER