Relevant bibliographies by topics / Slot allocation

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Slot allocation'

Author: Grafiati
Published: 4 June 2021
Last updated: 6 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Slot allocation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Slot allocation"

1

Letanovská, Mária. "Different Allocation Systems." Transport and Communications 2, no. 1 (2014): 12–15. http://dx.doi.org/10.26552/tac.c.2014.1.4.

Full text
Abstract:
Based on the London´s airports example it is obvious that there are differences between 3rd level airports. If the same coordination system would be introduced within various coordinated airports it could lead to various results. The results of analysis of intra-EU route data indicate that larger aircraft have been used at the 3rd level airports and there is no strong evidence of inefficient slot hoarding at these airports, not only before but also after the EC’s recognition of secondary slot trading. In contrast, the analysis of slot trading at Heathrow and Gatwick show that slot trading has taken place more likely within alliance and the chances have been very small for carriers to obtain slots from their actual or potential competitors. For the time being, there may be no need for additional regulatory interventions into secondary slot trading as there is little evidence of inefficient slot hoarding. However, the scarce opportunity of slot trading may lead to less intense competition and then to less efficient use of slots in the long run.
APA, Harvard, Vancouver, ISO, and other styles
2

Chen, Jihong, Xiang Liu, Xiaohua Zhang, Junliang He, and Lihua Luo. "Optimal Bilateral Cooperative Slot Allocation for Two Liner Carriers under a Co-Chartering Agreement." Journal of Navigation 70, no. 5 (April 17, 2017): 1170–82. http://dx.doi.org/10.1017/s0373463317000200.

Full text
Abstract:
The container liner shipping industry has stepped into an era of international strategic alliances. Important to these liner alliances is the sharing and allocation of container slots between its member carriers. This paper optimises planning of container ship capacity sharing and co-allocation under a co-charting agreement. First, we explain the concept of this business agreement and its implications on maritime operations. Then, we identify key influencing factors that may affect the decisions of cooperative slot co-allocation. The slot co-allocation problem is modelled as an Integer Programming problem and solved using data from two routes between the United States and Asia. The model determines the optimal slot co-allocation strategies between shipping alliance carriers along allied shipping routes. Computational results indicate that the proposed method is effective in obtaining optimal, cooperative slot sharing strategies that can maximise the total system revenue.
APA, Harvard, Vancouver, ISO, and other styles
3

S., Karthikeyan, Hari Seetha, and Manimegalai R. "Efficient Dynamic Resource Allocation in Hadoop Multiclusters for Load- Balancing Problem." Recent Advances in Computer Science and Communications 13, no. 4 (October 19, 2020): 686–93. http://dx.doi.org/10.2174/2213275912666190430161947.

Full text
Abstract:
Background: ‘Map-Reduce’ is the framework and its processing of data by rationalizing the distributed servers. also its running the various tasks in parallel way. The most important problem in map reduce environment is Resource Allocation in distributed environments and data locality to its corresponding slave nodes. If the applications are not scheduled properly then it leads to load unbalancing problems in the cloud environments. Objective: This Research suggests a new dynamic way of allocating the resources in hadoop multi cluster environment in order to effectively monitor the nodes for faster computation, load balancing and data locality issues. The dynamic slot allocation is explained theoretically in order to address the problems of pre configuration, speculative execution, delay in scheduling and pre slot allocation in hadoop environments. Experiment is done with Hadoop cluster which increases the efficiency of the nodes and solves the load balancing problem. Methods: The Current design of Map Reduce Hadoop systems are affected by underutilization of slots. The reason is the number of maps and reducer is allotted is smaller than the available number of maps and reducers. In Hadoop most of the times its noticed that dynamic slot allocation policy, the mapper or reducers are idle. So we can use those unused map tasks to overloaded reducer tasks in-order to increase the efficiency of MR jobs and vice versa. Results: The real time experiment was implemented with Multinode Hadoop cluster map reduce jobs of file size 1giga bytes to 5 giga bytes and various performance test has been taken. Conclusion: This paper focused on Hadoop map reduce resource allocation management techniques for multi cluster environments. It proposes a novel dynamic slot allocation policy to improve the performance of yarn scheduler and eliminates the load balancing problem. This work proves that dynamic slot allocation is outperforms more than yarn framework. In future it considered to concentrate on CPU bandwidth and processing time.
APA, Harvard, Vancouver, ISO, and other styles
4

Zeng, Bin, Jing Zhang, and Hai Qing Liu. "Optimal Channel Assignment Algorithm for Wireless Networks." Advanced Materials Research 211-212 (February 2011): 993–97. http://dx.doi.org/10.4028/www.scientific.net/amr.211-212.993.

Full text
Abstract:
In wireless cellular network, users will share the time-slots channel and bandwidth with voice users. With the characteristic of dynamic slot allocation, some time slots can be allocated to one single user. How to choose the slot allocation methodology is a significant problem when considering the system revenue and users’ satisfaction. A new model based on improvement of Markov Decision Process) is developed that can combines the original maximum system revenue model and the call blocking constraints, and will find out the optimal policy of time slots allocation. The experiment result shows that the new algorithm and model is efficient in the channel assignment area of wireless networks.
APA, Harvard, Vancouver, ISO, and other styles
5

Dr. R. Ashok kumar, V. M. Jemin, Dr M. N. Saravana kumar, Dr M. Ayyadurai,. "CONGESTION FREE CHANNEL ALLOCATION FOR HIGH TRAFFIC USING MAC IN WSN." INFORMATION TECHNOLOGY IN INDUSTRY 9, no. 1 (March 18, 2021): 1230–35. http://dx.doi.org/10.17762/itii.v9i1.262.

Full text
Abstract:
Slot Allocation Medium Access Channel (SAMAC), an efficient slot allocating MAC protocol is proposed for predicting the timely channel access for time-critical data operations and also to reduce data congestion. In this scheme the time of non-periodic critical traffic grabs the time slots allotted for the periodic non-critical data traffic. Additionally, Earliest Deadline First (EDF) scheduling algorithm is used to offer efficient channel access in emergency conditions where numerous sensor nodes are prompted concurrently to transmit the periodic time-critical data to the controller. SAMAC protocol is analyzed with the delay in data delivery rates for the time-critical traffic. Simulation analysis is carried out for proving the efficiency of SAMAC in terms of network throughput.
APA, Harvard, Vancouver, ISO, and other styles
6

Grunewald, Erik. "Incentive-based Slot Allocation for Airports." Transportation Research Procedia 14 (2016): 3761–70. http://dx.doi.org/10.1016/j.trpro.2016.05.461.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Chen, Jihong, and Shmuel Yahalom. "Container Slot Co-Allocation Planning with Joint Fleet Agreement in a Round Voyage for Liner Shipping." Journal of Navigation 66, no. 4 (May 23, 2013): 589–603. http://dx.doi.org/10.1017/s0373463313000192.

Full text
Abstract:
In the liner shipping market carriers share container slots to offer better service and realize economies of scale. This paper studies slot co-allocation planning for a joint fleet in a round trip for a shipping alliance in the liner shipping industry. In particular, a conceptual model is developed based on joint fleet and slot co-allocation management. The factors affecting slot co-allocation planning are explored in detail. A large-scale integer programming model is formulated to guide carriers in an alliance in pursuing an optimal slot co-allocation strategy. In contrast to the existing research, this approach leads to a more accurate representation of the situation for cooperative services in the liner shipping market. Extensive numerical experiments based on a true Asia-Europe cooperative route of COSCO and HANJIN show that the proposed model can be efficiently solved by LINGO11.0 for the case study. The computational results suggest that the mechanism and model can be used to benefit carriers in making better decisions in shipping cooperation services.
APA, Harvard, Vancouver, ISO, and other styles
8

Liu, Li Hua, Ya Ping Zhang, and Yu Wei. "A Pushback Slot Allocation Equilibrium Model Based on Game Theory." Advanced Materials Research 807-809 (September 2013): 2858–62. http://dx.doi.org/10.4028/www.scientific.net/amr.807-809.2858.

Full text
Abstract:
This paper analyses the relationship between airport and airline, the time slot allocation system is portrayed as a market where the airline can be seen as consumer, airport can be seen as the trader and the goods is the occupied pushback slots of airport. In that case, the generalized nash equilibrium game is presented based on game theory. Taking the Minimize delay as a target, a decision models of airport was established. The pushback slot allocation equilibrium model based on game theory is finnally formed, and a framework for solving the equilibrium solution is proposed.
APA, Harvard, Vancouver, ISO, and other styles
9

Yao, Qi, Lu Xu, and Qin Zhang. "Container Slot Allocation for Time-Sensitive Cargo in Maritime Transportation: A One-Phase Model with consideration of Port Congestion." Discrete Dynamics in Nature and Society 2021 (February 12, 2021): 1–11. http://dx.doi.org/10.1155/2021/6622291.

Full text
Abstract:
This paper studies a container slot allocation problem with dynamic pricing for time-sensitive cargo considering port congestion. Time-sensitive cargo calls for express delivery as soon as possible, and hence a new pricing pattern is proposed considering port congestion. To solve the slot allocation with dynamic pricing issue, a one-phase allocation model which is from different points of view on slot allocation strategy is proposed to formulate this problem. Finally, numerical examples are carried out to test the applicability of the proposed model and solution algorithm.
APA, Harvard, Vancouver, ISO, and other styles
10

Ribeiro, Nuno Antunes, Alexandre Jacquillat, António Pais Antunes, and Amedeo Odoni. "Improving slot allocation at Level 3 airports." Transportation Research Part A: Policy and Practice 127 (September 2019): 32–54. http://dx.doi.org/10.1016/j.tra.2019.06.014.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Slot allocation"

1

Schmid, Thomas 1969. "Slot allocation at European airports." Thesis, McGill University, 1999. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=30326.

Full text
Abstract:
International air transport has grown at a staggering rate over the last 50 years and the industry which supports it, now bears little resemblance to that which existed even twenty-five years ago. As the number of operators and the size of their respective fleets have increased, so too have the pressures on the infrastructure which support them. Particularly affected are the major airports where runway, apron and terminal capacity are limited. Unlike other elements of the aviation infrastructure, airport capacity is physically constrained and therefore capacity increases can only be obtained through further development or through more efficient uses of existing resources. As the first option is politically controversial and the latter only provides for incremental increases, the air transport industry, through IATA, has developed an allocation mechanism to distribute available capacity based on historic precedence. This thesis reviews the main issues surrounding the current regime. (Abstract shortened by UMI.)
APA, Harvard, Vancouver, ISO, and other styles
2

Schmid, Thomas. "Slot allocation at European airports." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/MQ64302.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Milner, Joseph M. (Joseph Micah). "Dynamic slot allocation with airline participation." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/11882.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Moessner, Philipp. "Slot allocation in the United States and Europe." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=99146.

Full text
Abstract:
The following thesis describes and analyzes the development of the U.S. slot allocation system from 1968 until today, in order to draw relevant conclusions for a new European Slot Regulation. The European Commission is currently drafting a new Slot Regulation purporting to introduce market mechanisms. A similar approach was espoused in the United States from 1986 onward, but was ultimately supplanted by overriding legislation in 2000. The analysis of the U.S. slot allocation system reveals the reasons underlying its abolition and queries whether this experience can be successfully transposed in Europe. The thesis commences by providing general information on the definition of slots, slot allocation, and airport capacity. A brief review of the European Commission's current consultation process on the implementation of market mechanisms for slot allocation follows. The main part of the thesis discusses the U.S. High Density Rule and the Rules for the Allocation and Transfer of High Density Airport Slots in historical order. Some criticisms frequently voiced assert that the Rules artificially limited access to airports, constituted barriers to market entry, restricted airline competition, generated higher fares, and yielded adverse effects on smaller communities which, in turn, lost access to key markets. Through a favorable assessment of the Rules, the thesis analyses these concerns and concludes that the suppression of the Rules was rather prompted by local political motivations than by other rationalities. However, experiences drawn from the U.S. Rules demonstrate that a future European secondary market for slots, if implemented under a grand fathering system, will likely have a positive impact on the efficiency of airport capacity, but not on access to the market and competition.
APA, Harvard, Vancouver, ISO, and other styles
5

Stevens, David Story. "TDMA slot allocation strategies for mobile packet radio networks." Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/9190.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Khan, Eraj, and Khizar Hayat. "GPS based Vehicle Conflict Measurement and Dynamic Slot Allocation." Thesis, Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-654.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Park, JinSoo. "Adaptive Asymmetric Slot Allocation for Heterogeneous Traffic in WCDMA/TDD Systems." Diss., Virginia Tech, 2004. http://hdl.handle.net/10919/29630.

Full text
Abstract:
Even if 3rd and 4th generation wireless systems aim to achieve multimedia services at high speed, it is rather difficult to have full-fledged multimedia services due to insufficient capacity of the systems. There are many technical challenges placed on us in order to realize the real multimedia services. One of those challenges is how efficiently to allocate resources to traffic as the wireless systems evolve. The review of the literature shows that strategic manipulation of traffic can lead to an efficient use of resources in both wire-line and wireless networks. This aspect brings our attention to the role of link layer protocols, which is to orchestrate the transmission of packets in an efficient way using given resources. Therefore, the Media Access Control (MAC) layer plays a very important role in this context. In this research, we investigate technical challenges involving resource control and management in the design of MAC protocols based on the characteristics of traffic, and provide some strategies to solve those challenges. The first and foremost matter in wireless MAC protocol research is to choose the type of multiple access schemes. Each scheme has advantages and disadvantages. We choose Wireless Code Division Multiple Access/Time Division Duplexing (WCDMA/TDD) systems since they are known to be efficient for bursty traffic. Most existing MAC protocols developed for WCDMA/TDD systems are interested in the performance of a unidirectional link, in particular in the uplink, assuming that the number of slots for each link is fixed a priori. That ignores the dynamic aspect of TDD systems. We believe that adaptive dynamic slot allocation can bring further benefits in terms of efficient resource management. Meanwhile, this adaptive slot allocation issue has been dealt with from a completely different angle. Related research works are focused on the adaptive slot allocation to minimize inter-cell interference under multi-cell environments. We believe that these two issues need to be handled together in order to enhance the performance of MAC protocols, and thus embark upon a study on the adaptive dynamic slot allocation for the MAC protocol. This research starts from the examination of key factors that affect the adaptive allocation strategy. Through the review of the literature, we conclude that traffic characterization can be an essential component for this research to achieve efficient resource control and management. So we identify appropriate traffic characteristics and metrics. The volume and burstiness of traffic are chosen as the characteristics for our adaptive dynamic slot allocation. Based on this examination, we propose four major adaptive dynamic slot allocation strategies: (i) a strategy based on the estimation of burstiness of traffic, (ii) a strategy based on the estimation of volume and burstiness of traffic, (iii) a strategy based on the parameter estimation of a distribution of traffic, and (iv) a strategy based on the exploitation of physical layer information. The first method estimates the burstiness in both links and assigns the number of slots for each link according to a ratio of these two estimates. The second method estimates the burstiness and volume of traffic in both links and assigns the number of slots for each link according to a ratio of weighted volumes in each link, where the weights are driven by the estimated burstiness in each link. For the estimation of burstiness, we propose a new burstiness measure that is based on a ratio between peak and median volume of traffic. This burstiness measure requires the determination of an observation window, with which the median and the peak are measured. We propose a dynamic method for the selection of the observation window, making use of statistical characteristics of traffic: Autocorrelation Function (ACF) and Partial ACF (PACF). For the third method, we develop several estimators to estimate the parameters of a traffic distribution and suggest two new slot allocation methods based on the estimated parameters. The last method exploits physical layer information as another way of allocating slot to enhance the performance of the system. The performance of our proposed strategies is evaluated in various scenarios. Major simulations are categorized as: simulation on data traffic, simulation on combined voice and data traffic, simulation on real trace data. The performance of each strategy is evaluated in terms of throughput and packet drop ratio. In addition, we consider the frequency of slot changes to assess the performance in terms of control overhead. We expect that this research work will add to the state of the knowledge in the field of link-layer protocol research for WCDMA/TDD systems.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
8

Jenkins, Alexander. "Relational Training Of Contextual Cues And Responses Allocation Towards Slot Machines." OpenSIUC, 2020. https://opensiuc.lib.siu.edu/theses/2778.

Full text
Abstract:
Slot machine gambling is the most addictive form of gambling and it is the most popular type of gambling in America (Abbot, 2001). The United States ranks number 1 in annual gambling losses, which equaled to about 40 million dollars (Ghezzi, Lyons, & Dixon, 2000). The present study sought to expand on previous studies by Zlomske & Dixon (2006) and Hoon et al. (2008) by using of contextual cues to teach conditional discrimination relations, one through exclusion, and evaluated the participants' response allocation across four different colored slot machines. Results demonstrated that all of the participants except for one was able to score one correct response when tested on the exclusionary stimuli. Further analysis showed that only a few of the participants' response allocation on the gambling task was altered towards the slot machines that shared the contextual cues of "best" and "greater than".
APA, Harvard, Vancouver, ISO, and other styles
9

Månsson, Jonas. "Principles for Channel Allocation in GSM." Thesis, Linköping University, Department of Electrical Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-10697.

Full text
Abstract:

In today's GSM system there is a complex resource situation when it comes to the scarce TDMA channels in the air interface, the time slots. There are both voice call services that use one or a half time slot and there are packet data users, that may share time slots with other packet data users, and they can use multiple channels at the same time. Allocating time to users is a crucial part in the system and it may affect the performance for the end user substantially.

In the future there may be more types of services than just voice and packet data and that these services may have specific demands on their channels, time slots. That means they would not be able to use just any of the available channels. The way to "give" services channels is what is called channel allocation. In this thesis four different services and three different principles for channel allocation is implemented in a Matlab simulator and simulated. The thesis goal is to determine which principle is best for which mix of services.

The principles that have been investigated are Flexible Algorithm that lets all services use all channels, Fix Dedication Algorithm where all channels are dedicated to a service and only can be used by that one and finally Soft Dedication Algorithm where all channels are dedicated to a service but may be used by other services when it is not needed by the preferred one.

The conclusion is, simplified, that the Soft Dedication Algorithm generates low blocking rates, high bandwidth and that it is a quite robust principle although the borrowing user may be preempted. It may not always be the best one but over all it is the one to prefer.


Detta examensarbete är utfört på uppdrag av och i samarbete med Ericsson och rör kanal- och resurshantering i GSM-systemet.

Ett ständigt problem vid trådlös och mobil kommunikation är den begränsade mängd frekvenser som finns tillgängliga i radiogränssnittet och hur pass nära två radioresursers frekvenser kan ligga varandra. I GSM används TDMA (Time Division Multiple Access) för att få plats med många användare på ett smalt frekvensband. TDMA innebär förenklat att tiden delas upp i åtta tidsluckor och att varje användare får tillgång till en av radioresurserna under en sådan tidslucka (kanal). Detta gäller både i upp- och nedlänk.

I nuläget finns två tjänster, paketdata och tal, som använder tidsluckorna på olika sätt. En talanvändare använder en eller en halv lucka själv medan paketdataanvändare kan dela på en eller flera luckor. Det finns alltså en mängd olika sätt att allokera, "dela ut", dessa luckor till ett givet antal användare. I nuläget har man en väl fungerande algoritm för detta men man tror att det i framtiden kommer att finnas fler tjänster med mer specifika krav på sina tidsluckor (kanaler) och att man då inte längre kan använda samma princip för kanalallokeringen.

I detta exjobb har tre nya, enkla och renodlade principer för kanalallokering undersökts för fyra fiktiva tjänster. Det tre principerna är Flexible Algorithm, där alla tjänster tillåts använda alla kanaler, Fix Dedication Algorithm, där alla kanaler är dedicerade till någon tjänst och endast kan användas av just denna tjänst; och slutligen Soft Dedication Algorithm som fungerar liknande den föregående men här kan tjänster "låna" kanaler av andra tjänster så längs som de är lediga. I Soft Dedication Algorithm kan en eventuell "låntagare" bli avbruten om en användare av rätt tjänst inte hittar en ledig kanal.

Utvärdering har skett genom att simulera systemet i en, delvis egengjord, Matlabsimulator.

Resultaten visar, förenklat, att Soft Dedication Algorithm är den bästa vad gäller låg blockering, kanalutnyttjande och även bandbredder. Den är även förhållandevis robust mot variationer i last.

APA, Harvard, Vancouver, ISO, and other styles
10

Milic, Dejan. "EXAMINING THE EFFECTS OF CONTEXTUAL STIMULI ON RESPONSE ALLOCATION IN SLOT MACHINE GAMBLING." OpenSIUC, 2020. https://opensiuc.lib.siu.edu/theses/2772.

Full text
Abstract:
The present study sought to identify the effects that derived relational training had on simulated gambling behavior with slot machines. Prior to conducting any relational training procedures, participants' relational responses in each contextual condition was probed. Each of the four backgrounds/conditions (red, blue, green, yellow) were presented with various stimuli from differing stimulus classes. Twenty trials were presented with no feedback for correct responding. Upon completion of the probes, pretest preference assessments were administered with blue and red slot machines being concurrently available for twenty trials then green and yellow slot machines doing the same. Following the pretest preference assessment, relational training began, here stimuli from each of the stimulus classes were presented on screen for three of the contextual conditions with the blue contextual condition left out to assess for possible derived relational responses. After completion, the second set of relational probes and posttest preference assessments began to assess if relational training altered the response allocation of slot machines and accuracy of responding during probes. After relational training, all participants showed an increase in response allocation to the red slot machine and a decrease to the blue. The yellow slot machine was selected increasingly with three participants while green was selected more often with one individual, one staying at the same number, and two selecting it less than in the pretest.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Slot allocation"

1

Authority, Civil Aviation. Slot allocation: A proposal for Europe's airports. London: Civil Aviation Authority, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mark, Isaac R., and Plott Charles R, eds. The allocation of scarce resources: Experimental economics and the problem of allocating airport slots. Boulder: Westview Press, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Silingardi, Gabriele. Gli slots: Il caso Italia fra esperienza statunitense e comunitaria. Torino: G. Giappichelli, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Aviation Competition Restoration Act: Report of the Committee on Commerce, Science, and Transportation on S. 415. Washington: U.S. G.P.O., 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

United States. Congress. Senate. Committee on Commerce, Science, and Transportation. S. 415, Aviation Competition Restoration Act: Hearing before the Committee on Commerce, Science, and Transportation, United States Senate, One Hundred Seventh Congress, first session, March 13, 2001. Washington: U.S. G.P.O., 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

United States. Congress. House. Committee on Transportation and Infrastructure. Subcommittee on Aviation. Slot lottery at LaGuardia Airport: Hearing before the Subcommittee on Aviation of the Committee on Transportation and Infrastructure, House of Representatives, One Hundred Sixth Congress, second session, December 5, 2000. Washington: U.S. G.P.O., 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Judiciary, United States Congress House Committee on the. State of competition in the airline industry: Hearing before the Committee on the Judiciary, House of Representatives, One Hundred Sixth Congress, second session. Washington, D.C: U.S. G.P.O., 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

State of competition in the airline industry: Hearing before the Committee on the Judiciary, House of Representatives, One Hundred Fifth Congress, second session, May 19, 1998. Washington: U.S. G.P.O., 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

United States. Congress. House. Committee on the Judiciary. State of competition in the airline industry: Hearings before the Committee on the Judiciary, House of Representatives, One Hundred Sixth Congress, second session, June 14 and June 23, 2000. Washington: U.S. G.P.O., 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

United, States Congress Senate Committee on Commerce Science and Transportation. Airline Competition Equity Act of 1990: Report of the Senate Committee on Commerce, Science, and Transportation on S. 2851. Washington: U.S. G.P.O., 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Slot allocation"

1

Durand, Nicolas, David Gianazza, Jean-Baptiste Gotteland, and Jean-Marc Alliot. "Departure Slot Allocation." In Metaheuristics for Air Traffic Management, 85–99. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2015. http://dx.doi.org/10.1002/9781119261513.ch4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Liu, Rongrong, Xiaofeng Rong, Shujuan Huang, and Lianjong Zhong. "Markov Based Dynamic Slot Allocation Algorithm." In Theory, Methodology, Tools and Applications for Modeling and Simulation of Complex Systems, 67–76. Singapore: Springer Singapore, 2016. http://dx.doi.org/10.1007/978-981-10-2663-8_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tian, Wei-zhen, Ming-rui Guo, and Xiong-chang Pang. "A Hybrid Slot Allocation Algorithm for TDMA Network." In Proceedings of the 6th International Asia Conference on Industrial Engineering and Management Innovation, 19–30. Paris: Atlantis Press, 2015. http://dx.doi.org/10.2991/978-94-6239-145-1_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zeng, Hui, Qiang Chen, Xiaoqiang Li, and Jianguo Shen. "Application Analysis of Slot Allocation Algorithm for Link16." In Lecture Notes in Electrical Engineering, 55–63. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-01766-2_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Son, Seokho, and Kwang Mong Sim. "Relaxed Time Slot Negotiation for Grid Resource Allocation." In Communications in Computer and Information Science, 25–32. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10549-4_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Xiao, Wenya, and Jinghua Zhao. "Airline Slot Allocation Optimization Decision Under CDM Mechanism." In Lecture Notes on Data Engineering and Communications Technologies, 966–70. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-5854-9_135.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lee, Junghoon, and Gyung-Leen Park. "Extra Slot Allocation for Fair Data Collection in the Slot-Based Grid Network." In Wireless Algorithms, Systems, and Applications, 287–90. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14654-1_36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Benkner, Thorsten. "Dynamic Slot Allocation for TDMA-Systems with Packet Access." In The Kluwer International Series in Engineering and Computer Science, 103–16. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4613-1409-7_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wolf, Joel, Deepak Rajan, Kirsten Hildrum, Rohit Khandekar, Vibhore Kumar, Sujay Parekh, Kun-Lung Wu, and Andrey Balmin. "FLEX: A Slot Allocation Scheduling Optimizer for MapReduce Workloads." In Middleware 2010, 1–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16955-7_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Toporkov, Victor, Anna Toporkova, and Dmitry Yemelyanov. "Slot Co-allocation Optimization in Distributed Computing with Heterogeneous Resources." In Intelligent Distributed Computing XII, 40–49. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99626-4_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Slot allocation"

1

Rahim, Siti Khatijah Nor Abdul, Andrzej Bargiela, and Rong Qu. "Granular Modelling Of Exam To Slot Allocation." In 23rd European Conference on Modelling and Simulation. ECMS, 2009. http://dx.doi.org/10.7148/2009-0861-0866.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tang, Shanjiang, Bu-Sung Lee, and Bingsheng He. "Dynamic slot allocation technique for MapReduce clusters." In 2013 IEEE International Conference on Cluster Computing (CLUSTER). IEEE, 2013. http://dx.doi.org/10.1109/cluster.2013.6702631.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ganesan, K., and K. Vignesh. "Automated parking slot allocation using RFID technology." In 2007 9th International Symposium on Signal Processing and Its Applications (ISSPA). IEEE, 2007. http://dx.doi.org/10.1109/isspa.2007.4555296.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ming-Hung Tao and Ying-Chuan Hsiao. "Slot-based persistent allocation for WiMAX systems." In 2010 IEEE 21st International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC 2010). IEEE, 2010. http://dx.doi.org/10.1109/pimrc.2010.5672026.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Stavrakakis, I. "Capacity allocation under random slot assignment policy." In IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings. IEEE, 1991. http://dx.doi.org/10.1109/infcom.1991.147510.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Rana, Yuvraj, Bao Liu, Alfandika Nyandoro, and Sanjay Jha. "Bandwidth Aware Slot Allocation in Hybrid MAC." In 2006 31st IEEE Conference on Local Computer Networks. IEEE, 2006. http://dx.doi.org/10.1109/lcn.2006.322075.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Unk, Niraj, Ankit Trivedi, and Abdul Razaque. "Dynamic allocation of slot using MAC protocol." In 2016 IEEE Long Island Systems, Applications and Technology Conference (LISAT). IEEE, 2016. http://dx.doi.org/10.1109/lisat.2016.7494147.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Zeng, Bin, and Rui Wang. "Optimal Slot Allocation Method for ITE Systems." In 3rd International Conference on Wireless Communication and Sensor Networks (WCSN 2016). Paris, France: Atlantis Press, 2017. http://dx.doi.org/10.2991/icwcsn-16.2017.41.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lv, Longfei. "A Data-link Dynamic Slot Allocation Algorithm." In 2018 8th International Conference on Mechatronics, Computer and Education Informationization (MCEI 2018). Paris, France: Atlantis Press, 2018. http://dx.doi.org/10.2991/mcei-18.2018.34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zhang, Tiangang, Ronglu Sun, Xiaoyun Hou, and Rentian Yue. "A Slot Allocation Algorithm for the Flights." In Seventh International Conference on Traffic and Transportation Studies (ICTTS) 2010. Reston, VA: American Society of Civil Engineers, 2010. http://dx.doi.org/10.1061/41123(383)118.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Slot allocation"

1

Peters, Amanda, and Linda Zeger. Efficient Resource Allocation for Broadcasting Multi-Slot Messages With Random Access with Capture. Fort Belvoir, VA: Defense Technical Information Center, March 2011. http://dx.doi.org/10.21236/ada541058.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Topa, M. A., D. A. Weinstein, and W. A. Retzlaff. Assessing the Significance of Above- and Belowground Carbon Allocation of Fast- and Slow-Growing Families of Loblolly Pine - Final Report. Office of Scientific and Technical Information (OSTI), March 2001. http://dx.doi.org/10.2172/783597.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Slot allocation' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography