Sökning: "Integer Sequences"

Visar resultat 1 - 5 av 11 avhandlingar innehållade orden Integer Sequences.

  1. 1. On Degree Variance in Random Graphs

    Författare :Jan Hagberg; Ove Frank; Tom A.B. Snijders; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Degree Sequences; Uniform Random Graphs; Bernoulli Graphs; Degree Moments; Degree Statistics; Degree Variance; Gamma Approximation; Centrality Testing; Integer Sequences; Statistics; Statistik;

    Sammanfattning : This thesis is concerned with degree moments and degree variance in random graphs. The degree of vertex i in a graph is the number of edges incident to vertex i.In the first paper, degree moments and functions of degree moments are investigated for three random graph models. LÄS MER

  3. 2. Sequences and games generalizing the combinatorial game of Wythoff Nim

    Författare :Urban Larsson; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Blocking manoeuvre; Beatty sequence; Combinatorial game; Complementary sequences; Impartial game; Interspersion array; Muller twist; Nim; Permutation of the natural numbers; Stolarsky array; Wythoff Nim; Beatty sequence;

    Sammanfattning : One single Queen is placed on an arbitrary starting position of a (large) Chess board. Two players alternate in moving the Queen as in a game of Chess but with the restriction that the $L^1$ distance to the lower left corner, position $(0,0)$, must decrease. The player who moves there wins. Let $\phi =\frac{1+\sqrt{5}}{2}$, the golden ratio. LÄS MER

  4. 3. Contributions to dual subgradient optimization and maintenance scheduling

    Författare :Emil Gustavsson; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Subgradient optimization; Lagrangian duality; convex programming; maintenance scheduling; integer optimization; Lagrangian duality;

    Sammanfattning : This thesis analyses two topics within the area of mathematical optimization; dual subgradient methods and maintenance optimization. The first two papers consider dual subgradient methods, and the third paper considers maintenance optimization. LÄS MER

  5. 4. Optimization of Just-in-Time Sequencing Problems and Supply Chain Logistics

    Författare :Gyan Thapa; Sergei Silvestrov; Anatoliy Malyarenko; George Fodor; Mälardalens högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Just-in-time; JIT sequencing; apportionment; product rate variation; output rate variation; algorithms; heuristics; supply chain; logistics; queueing; non-linear integer programming; Mathematics Applied Mathematics; matematik tillämpad matematik;

    Sammanfattning : This dissertation presents a comprehensive and comparative progress in sequencing approaches of mixed-model just-in-time (JIT) sequencing problem together with discrete apportioment problem (DAP). The goal of JIT sequencing problem (JITSP) is to keep the rate of usage of parts as constant as possible along the assembly lines, and the goal of DAP is to divide a given integer number of delegates proportionally among the states or the parties according to their population or votes. LÄS MER

  7. 5. Analysis, synthesis and application of automaton-based constraint descriptions

    Författare :María Andreína Francisco Rodríguez; Justin Pearson; Pierre Flener; Christopher Jefferson; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; constraint programming; constraint predicates; global constraints; automata; automaton-described constraint predicates; automaton-induced constraint decompositions; implied constraints; time-series constraints; transducers; automaton invariants; Computer Science; Datavetenskap;

    Sammanfattning : Constraint programming (CP) is a technology in which a combinatorial problem is modelled as a conjunction of constraints on variables ranging over given initial domains, and optionally an objective function on the variables. Such a model is given to a general-purpose solver performing systematic search to find constraint-satisfying domain values for the variables, giving an optimal value to the objective function. LÄS MER