Sökning: "connected restrictions"
Visar resultat 1 - 5 av 25 avhandlingar innehållade orden connected restrictions.
1. The Price We Pay : The Autonomy of Store Managers in Making Price Decisions: The Case of Grocery Retailing
Sammanfattning : In this dissertation, the store manager’s autonomy in making price decisions is explored to further our understanding of this actor. As a result, the store manager’s embeddedness in the manufacturer-retailer-consumer triad provides a more holistic view of the price decisions made in grocery retailing. LÄS MER
2. Improving the Adaptability of the End-host : Service-aware Network Stack Tuning
Sammanfattning : The Internet of today is very different from how it used to be. Modern networked applications are becoming increasingly diverse. Consequently, a variety of requirements must be met by the network. Efforts to make the underlying mechanisms of the Internet more flexible have therefore been made to adapt to this diversification. LÄS MER
3. Computations in the Grothendieck Group of Stacks
Sammanfattning : Given an algebraic group, one may consider the class of its classifying stackin the Grothendieck group of stacks. This is an invariant studied byEkedahl. For certain connected groups, called the special groups bySerre and Grothendieck, the invariant simply gives the inverse of the class ofthe group itself. LÄS MER
4. Tilted Foils Nuclear Spin Polarization and Measurement with Coulomb Excitation
Sammanfattning : Developing new experimental tools is essential to expand the possibilites of probing the structure of atomic nuclei. The better the currently known properties of nuclei can be manipulated, the more information can be extracted from data collected in nuclear reaction experiments. LÄS MER
5. Random railways and cycles in random regular graphs
Sammanfattning : In a cubic multigraph certain restrictions on the paths are made to define what is called a railway. Due to these restrictions a special kind of connectivity is defined. As the number of vertices tends to infinity, the asymptotic probability of obtaining an, in this sense, connected random cubic multigraph is shown to be 1/3. LÄS MER