Sökning: "Time constraints"

Visar resultat 1 - 5 av 904 avhandlingar innehållade orden Time constraints.

  1. 1. Commuting time choice and the value of travel time

    Författare :Jan-Erik Swärdh; Lars Hultkrantz; Bruno De Borger; Örebro universitet; []
    Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; Value of time; Value of travel time; Commuting; Commuting time changes; Value of commuting time; Register data; On-the-job search; Revealed preferences; Stated preferences; Hypothetical bias; Scheduling constraints; Relocations; Certainty calibration; Quantile regression; Mixed logit; Gender differences; Economics; Nationalekonomi; SOCIAL SCIENCES; SAMHÄLLSVETENSKAP; Economics; Nationalekonomi;

    Sammanfattning : In the modern industrialized society, a long commuting time is becoming more and more common. However, commuting results in a number of different costs, for example, external costs such as congestion and pollution as well as internal costs such as individual time consumption. LÄS MER

  3. 2. Real-Time Workload Models : Expressiveness vs. Analysis Efficiency

    Författare :Martin Stigge; Wang Yi; Sanjoy Baruah; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Real-time systems; task models; EDF; fixed-priority scheduling; schedulability analysis; response-time analysis; abstraction refinement; Computer Science with specialization in Real Time Systems; Datavetenskap med inriktning mot realtidssystem;

    Sammanfattning : The requirements for real-time systems in safety-critical applications typically contain strict timing constraints. The design of such a system must be subject to extensive validation to guarantee that critical timing constraints will never be violated while the system operates. LÄS MER

  4. 3. Servicescapes seen by visually impaired travellers : Time-geography approach to servicescape research

    Författare :Alma Raissova; Institutionen för tjänstevetenskap; []
    Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; servicescape; time-geography; constraints; tactics; blind; visually impaired persons; servicescape; tidsgeografi; begränsningar; taktik; blinda; synskadade;

    Sammanfattning : Knowledge gaps remain in the study of servicescapes, since existing research on servicescapes tends to ignore major advances in the understanding of space and time as social phenomena. One aspect that particularly requires further study is how emerging constraints influence customers’ interactions with organized service places. LÄS MER

  5. 4. Symmetry Breaking Ordering Constraints

    Författare :Zeynep Kiziltan; Andreas Hamfelt; Toby Walsh; Pedro Meseguer; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datavetenskap; Constraint satisfaction; constraint programming; modelling; symmetry breaking; global constraints; Datavetenskap; Computer science; Datavetenskap;

    Sammanfattning : Many problems in business, industry, and academia can be modelled as constraint programs consisting of matrices of decision variables. Such “matrix models” often have symmetry. In particular, they often have row and column symmetry as the rows and columns can freely be permuted without affecting the satisfiability of assignments. 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