Academic literature on the topic 'Delay optimization'

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 'Delay optimization.'

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 "Delay optimization"

1

Tennakoon, Hiran, and Carl Sechen. "Nonconvex Gate Delay Modeling and Delay Optimization." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 27, no. 9 (September 2008): 1583–94. http://dx.doi.org/10.1109/tcad.2008.927758.

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

Ren, Zhaolin, Zhengyuan Zhou, Linhai Qiu, Ajay Deshpande, and Jayant Kalagnanam. "Delay-Adaptive Distributed Stochastic Optimization." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 04 (April 3, 2020): 5503–10. http://dx.doi.org/10.1609/aaai.v34i04.6001.

Full text
Abstract:
In large-scale optimization problems, distributed asynchronous stochastic gradient descent (DASGD) is a commonly used algorithm. In most applications, there are often a large number of computing nodes asynchronously computing gradient information. As such, the gradient information received at a given iteration is often stale. In the presence of such delays, which can be unbounded, the convergence of DASGD is uncertain. The contribution of this paper is twofold. First, we propose a delay-adaptive variant of DASGD where we adjust each iteration's step-size based on the size of the delay, and prove asymptotic convergence of the algorithm on variationally coherent stochastic problems, a class of functions which properly includes convex, quasi-convex and star-convex functions. Second, we extend the convergence results of standard DASGD, used usually for problems with bounded domains, to problems with unbounded domains. In this way, we extend the frontier of theoretical guarantees for distributed asynchronous optimization, and provide new insights for practitioners working on large-scale optimization problems.
APA, Harvard, Vancouver, ISO, and other styles
3

Bhattacharya, Prabhati, and Mark R. Virkler. "Optimization for Pedestrian and Vehicular Delay in a Signal Network." Transportation Research Record: Journal of the Transportation Research Board 1939, no. 1 (January 2005): 115–22. http://dx.doi.org/10.1177/0361198105193900114.

Full text
Abstract:
The efficiency of an arterial network can be enhanced by optimizing the user costs incurred because of delays and other socioeconomic factors. Until recently, research mostly focused on minimizing vehicular delay to optimize user costs. Currently, no signal coordination tool exists to balance delays to both vehicles and pedestrians. A methodology that uses known techniques and available tools to identify an optimal signal coordination plan is developed. Pedestrian delay patterns are obtained from previous research. Delay data for vehicles are based on the modeling of peak-hour traffic conditions in urbanized areas of a hypothetical city. The signal optimization software Synchro (Version 3.2) was used to investigate the variations in vehicle delay with different signal coordination plans and offsets. The results reveal that the best offsets for vehicles and pedestrians are not necessarily the same. Consequently, a signal coordination plan that would benefit both should consider the total user costs of the system. The results show that the highest total pedestrian delay can spike up the user costs more than the highest total vehicular delay. The offset that generates the optimal user cost can be different from the best offset for vehicles or pedestrians. Thus, a balance between pedestrian delay and vehicular delay can be achieved to arrive at an optimal signal coordination plan.
APA, Harvard, Vancouver, ISO, and other styles
4

Wang, Xiao-Dong, and Tom Chen. "Performance and Area Optimization of VLSI Systems Using Genetic Algorithms." VLSI Design 3, no. 1 (January 1, 1995): 43–51. http://dx.doi.org/10.1155/1995/26912.

Full text
Abstract:
A new performance and area optimization algorithm for complex VLSI systems is presented. It is widely believed within the VLSI CAD community that the relationship between delay and silicon area of a VLSI chip is convex. This conclusion is based on a simplified linear RC model to predict gate delays. In the proposed optimization algorithm, a nonlinear, non-RC based transistor delay model was used which resulted in a non-convex relationship between the delay and the silicon area of a VLSI chip. Genetic algorithms are better suited for discrete, non-convex, non-linear optimization problems than traditional calculus-based algorithms. By using the genetic algorithms in the performance and area optimization, we are able to find the optimal values for both delay and silicon area for the ISCAS benchmark circuits.
APA, Harvard, Vancouver, ISO, and other styles
5

Lin, Xuemin. "Delay Optimization in Quorum Consensus." Algorithmica 38, no. 2 (October 10, 2003): 397–413. http://dx.doi.org/10.1007/s00453-003-1066-x.

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

Yu, Zhengyao, Vikash V. Gayah, and Eleni Christofa. "Person-Based Optimization of Signal Timing." Transportation Research Record: Journal of the Transportation Research Board 2620, no. 1 (January 2017): 31–42. http://dx.doi.org/10.3141/2620-04.

Full text
Abstract:
Recent studies have proposed the use of person-based frameworks for the optimization of traffic signal timing to minimize the total passenger delay experienced by passenger cars and buses at signalized intersections. The efficiency and applicability of existing efforts, however, have been limited by an assumption of fixed cycle lengths and deterministic bus arrival times. An existing algorithm for person-based optimization of signal timing for isolated intersections was extended to accommodate flexible cycle lengths and uncertain bus arrival times. To accommodate flexible cycle lengths, the mathematical program was redefined to minimize total passenger delay within a fixed planning horizon that allowed cycle lengths to vary within a feasible range. Two strategies were proposed to accommodate uncertain bus arrival times: ( a) a robust optimization approach that conservatively minimized delays experienced in a worst-case scenario and ( b) a blended strategy that combined deterministic optimization and rule-based green extensions. The proposed strategies were tested with numerical simulations of an intersection in State College, Pennsylvania. Results revealed that the flexible cycle length algorithm could significantly reduce bus passenger delay and total passenger delay, with negligible increases in car passenger delay. These results were robust to changes in both bus and car flows. For bus arrival times, the robust optimization strategy seemed to be more effective at low levels of uncertainty and the blended strategy at higher levels of uncertainty. The anticipated benefits decreased with increases in the intersection flow ratio because of the lower flexibility of signal timing at the intersection.
APA, Harvard, Vancouver, ISO, and other styles
7

Kuźmiński, Łukasz, Piotr Maśloch, Marek Bazan, Tomasz Janiczek, Krzysztof Halawa, Henryk Wojtaszek, Ireneusz Miciuła, et al. "Management of Delay Optimization at Intersections." Energies 13, no. 12 (June 15, 2020): 3087. http://dx.doi.org/10.3390/en13123087.

Full text
Abstract:
Congestion extends the time of the journey for both people and goods. Therefore, transport solutions should be optimized. Management scientists and technical scientists worked together in order to develop a proprietary solution to increase efficiency in terms of productivity improvements for intelligent transport systems. The most fundamental functions of management have been paired with a detailed analysis of city traffic. The authors developed a method for determining the order of vehicles at traffic lights and connected it with vehicle-to-vehicle communication and GPS signals. As a result, a novel method to increase the throughput of intersections is presented. This solution generates a sound signal in order to inform the driver that the preceding car has started moving forward. The proposed solution leads to the shortening of the reaction time of the drivers waiting in a queue. This situation is most common at red lights. Consequently, the traffic simulation shows that the discharge of queues at traffic lights may be quicker by up to 13.5%. Notably, that proposed solution does not require any modification of the infrastructure as well as any additional devices for vehicle-to-infrastructure communication at the road intersections. To conclude, proper implementation of the proposed solution will certainly contribute to efficiency improvements within intelligent transport systems, with the potential to reduce traffic jams.
APA, Harvard, Vancouver, ISO, and other styles
8

YE, Ping, Yi-Zhong LI, and Qin XIA. "Delay Optimization Based Overlay Routing Strategy." Chinese Journal of Computers 33, no. 1 (April 22, 2010): 36–44. http://dx.doi.org/10.3724/sp.j.1016.2010.00036.

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

Intiso, S., I. Kataeva, E. Tolkacheva, H. Engseth, K. Platov, and A. Kidiyarova-Shevchenko. "Time-Delay Optimization of RSFQ Cells." IEEE Transactions on Appiled Superconductivity 15, no. 2 (June 2005): 328–31. http://dx.doi.org/10.1109/tasc.2005.849823.

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

Alpert, C. J., A. Devgan, and C. V. Kashyap. "RC delay metrics for performance optimization." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 20, no. 5 (May 2001): 571–82. http://dx.doi.org/10.1109/43.920682.

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

Dissertations / Theses on the topic "Delay optimization"

1

Ma, Min. "RC delay metrics for interconnect optimization." Thesis, McGill University, 2004. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=81554.

Full text
Abstract:
The main challenge for developing accurate and efficient delay metrics has been the prediction of delay to points on the interconnect which are relatively close to the source. Those metrics which are relatively successful in meeting this challenge require two-dimensional look-up tables and algorithm tuning, and are quite challenging to implement. The simpler explicit metrics only work well on so-called far nodes, which are characterized by all-pole frequency responses.
In this thesis, we first review an existing delay metric for wires and then try to extend it to arbitrary tree networks. Thorough tests demonstrate it to be accurate and efficient for wires only. We then present an explicit delay metric for dealing with near nodes in RC interconnect, which is based on the first three moments of the impulse response. An accurate model for the delay to the internal node of a two-pole one-zero RC circuit serves as the core of the new metric. Since no simplifying assumption is made in the model, it returns excellent accuracy at the internal node in any two-node RC circuit, no matter how close the internal node is to the source. The delay at near nodes in arbitrary RC trees is then computed by order reduction to a two-pole system using the first three moments of the impulse response. A significant further improvement in accuracy is achieved by correcting for the skewness of the impulse response. In parallel, a simple explicit metric is introduced for predicting the delay to far nodes, where order reduction is not needed. This is based on the first moment of the node of interest and the second moment of the slowest node. Furthermore a simple criterion is derived for distinguishing near nodes from far nodes. Tests on RC models of wires and trees demonstrate that the combination of these two metrics is accurate within 2% for far nodes and within 5% for near nodes with delays which are as much as an order of magnitude smaller than that of the slowest node.
APA, Harvard, Vancouver, ISO, and other styles
2

Anemogiannis, Emmanuel. "Integrated optical delay-lines : architectures, performance optimization, and applications." Diss., Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/15398.

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

Yuan, Duojia, and S3024047@student rmit edu au. "Flight Delay-Cost Simulation Analysis and Airline Schedule Optimization." RMIT University. Aerospace, Mechanical, Manufacturing Engineering, 2007. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20080618.092923.

Full text
Abstract:
In order to meet the fast-growing demand, airlines have applied much more compact air-fleet operation schedules which directly lead to airport congestion. One result is the flight delay, which appears more frequently and seriously; the flight delay can also significantly damage airline's profitability and reputation The aim of this project is to enhance the dispatch reliability of Australian X Airline's fleet through a newly developed approach to reliability modeling, which employs computer-aided numerical simulation of the departure delay distribution and related cost to achieve the flight schedule optimization. The reliability modeling approach developed in this project is based on the probability distributions and Monte Carlo Simulation (MCS) techniques. Initial (type I) delay and propagated (type II) delay are adopted as the criterion for data classification and analysis. The randomicity of type I delay occurrence and the internal relationship between type II delay and changed flight schedule are considered as the core factors in this new approach of reliability modeling, which compared to the conventional assessment methodologies, is proved to be more accurate on the departure delay and cost evaluation modeling. The Flight Delay and Cost Simulation Program (FDCSP) has been developed (Visual Basic 6.0) to perform the complicated numerical calculations through significant amount of pseudo-samples. FDCSP is also designed to provide convenience for varied applications in dispatch reliability modeling. The end-users can be airlines, airports and aviation authorities, etc. As a result, through this project, a 16.87% reduction in departure delay is estimated to be achieved by Australian X Airline. The air-fleet dispatch reliability has been enhanced to a higher level - 78.94% compared to initial 65.25%. Thus, 13.35% of system cost can be saved. At last, this project also achieves to set a more practical guideline for air-fleet database and management upon overall dispatch reliability optimization.
APA, Harvard, Vancouver, ISO, and other styles
4

Ullah, Shafqat. "Algorithm for Non-Linear Feedback Shift Registers Delay Optimization." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-62815.

Full text
Abstract:
Information Technology has revolutionized the way of our life, the raise of information technology has given birth to the information security. The design and implementation of information security techniques especially for wireless systems such as Mobiles, and RFIDs is receiving a lot of attentions. Stream ciphers are very good candidates for providing information security to wireless systems specially for RFIDs, because they are fast as compared to block ciphers, easy to implement, have small footprint, and consume less power. LFSRs can be use to implement the stream ciphers but they care exposed to different kind of cryptanalytic attacks on the other hand NLFSR based stream ciphers are resistant to cryptanalytic attacks to which pure LFSR based stream cipher are exposed. Just like LFSRs the NLFSRs can also be implemented in two types of configurations i.e. Fibonacci and Galois. The critical path of the Galois based NLFSRs is smaller than the Fibonacci NLFSRs this make Galois NLFSRs favorite for applications which need to run at a faster speed. Fibonacci NLFSRs can be converted to Galois NLFSRs but the conversion from Fibonacci to Galois is one-to-many relation i.e. for a single Fibonacci NLFSR we can have many equivalent Galois NLFSRs. The dilemma is that not all the equivalent Galois NLFSRs are optimal so in order for efficient implementation one has to search for the best possible Galois NLFSR. The complexity of search space is 0(nk), here represents the n − bit NLFSR and represents the number of products in the ANF of the feedback function of Fibonacci NLFSR, the NLFSR used in existing stream cipher usually havek less than or equal to 32( for hardware efficiency reasons) and n is of order of 128 (for cryptographic security reasons). The complexity of the search space shows that the normal brute force method will take considerable amount of time to produce the results. To address this problem a heuristic algorithm is proposed in [6] which uses the Primary Cost Function to estimate the critical path of the NLFSRs and produce the results, however the algorithm in [6] did not addressed a lot of issues for example it was unable to divide the products among the functions equally, it was unable to divide the product in such a way which would lead to optimization by synthesis tool. The Primary Cost Function proposed in [6] had flaws it was unable to find the difference between the function which can be optimized and which cannot be. This thesis proposes another heuristic algorithm which addresses the problem present in the [6]. The Primary Cost Function used in the [6] is also used in the proposed algorithm but with some modification and improvements. Besides using Primary Cost function, the proposed algorithm also uses other cost functions such Secondary Cost, XOR reduced Cost and Number of Literals Cost functions to find the best possible Galois NLFSR. The algorithm proposed in this thesis was tested on Vest, Achterbahn, Gain-128/80 ciphers and Cipher [8]. The Vest improved by 5.28% in delay and 17.39% in terms of area as compared to the results of [6], similarly Achterbahn, Gain, and Cipher [8] improved by 1.79%, 16.63%, 1.43% in delay and improvement in area were 2.09%, 1.001% , - 0.101% respectively.
APA, Harvard, Vancouver, ISO, and other styles
5

Mostafa, Ahmad A. "Packet Delivery Delay and Throughput Optimization for Vehicular Networks." University of Cincinnati / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1367924037.

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

Chen, Chung-ping. "Performance-driven interconnect optimization /." Digital version accessible at:, 1998. http://wwwlib.umi.com/cr/utexas/main.

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

Prakash, Piyush Martin Alain J. Martin Alain J. "Throughput optimization of quasi delay insensitive circuits via slack matching /." Diss., Pasadena, Calif. : California Institute of Technology, 2008. http://resolver.caltech.edu/CaltechETD:etd-05262008-234258.

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

Gunawardana, Upul, and Kurt Kosbar. "OPTIMIZATION OF REFERENCE WAVEFORM FILTERS IN COHERENT DELAY LOCKED LOOPS." International Foundation for Telemetering, 1999. http://hdl.handle.net/10150/606804.

Full text
Abstract:
International Telemetering Conference Proceedings / October 25-28, 1999 / Riviera Hotel and Convention Center, Las Vegas, Nevada
In this paper, a new coherent correlation-loop architecture for tracking direct-sequence spread-spectrum signals is proposed. In the proposed correlation loop model, the mean-square tracking error is minimized by varying the cross-correlation function between the received signal and the locally generated signal. The locally generated signal is produced by passing a replica of the transmitted signal through a linear time-invariant filter, which is termed the VCC filter. The issue of bandwidth of a correlation loop is addressed and a bandwidth definition for comparative purposes is introduced. The filter characteristics to minimize the tracking errors are determined using numerical optimization algorithms. This work demonstrates that the amplitude response of the VCC filter is a function of the input signal-to-noise ratio (SNR). In particular, the optimum filter does not replicate a differentiator at finite signal-to-noise ratio as is sometimes assumed. The optimal filter characteristics and the knowledge of the input SNR can be combined to produce a device that has very low probability of loosing lock.
APA, Harvard, Vancouver, ISO, and other styles
9

Calle, Laguna Alvaro Jesus. "Isolated Traffic Signal Optimization Considering Delay, Energy, and Environmental Impacts." Thesis, Virginia Tech, 2017. http://hdl.handle.net/10919/74238.

Full text
Abstract:
Traffic signal cycle lengths are traditionally optimized to minimize vehicle delay at intersections using the Webster formulation. This thesis includes two studies that develop new formulations to compute the optimum cycle length of isolated intersections, considering measures of effectiveness such as vehicle delay, fuel consumption and tailpipe emissions. Additionally, both studies validate the Webster model against simulated data. The microscopic simulation software, INTEGRATION, was used to simulate two-phase and four-phase isolated intersections over a range of cycle lengths, traffic demand levels, and signal timing lost times. Intersection delay, fuel consumption levels, and emissions of hydrocarbon (HC), carbon monoxide (CO), oxides of nitrogen (NOx), and carbon dioxide (CO2) were derived from the simulation software. The cycle lengths that minimized the various measures of effectiveness were then used to develop the proposed formulations. The first research effort entailed recalibrating the Webster model to the simulated data to develop a new delay, fuel consumption, and emissions formulation. However, an additional intercept was incorporated to the new formulations to enhance the Webster model. The second research effort entailed updating the proposed model against four study intersections. To account for the stochastic and random nature of traffic, the simulations were then run with twenty random seeds per scenario. Both efforts noted its estimated cycle lengths to minimize fuel consumption and emissions were longer than cycle lengths optimized for vehicle delay only. Secondly, the simulation results manifested an overestimation in optimum cycle lengths derived from the Webster model for high vehicle demands.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
10

李澤康 and Chak-hong Lee. "Nonlinear time-delay optimal control problem: optimality conditions and duality." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1995. http://hub.hku.hk/bib/B31212475.

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

Books on the topic "Delay optimization"

1

Mohammad, Jamshidi, ed. Time-delay systems: Analysis, optimization, and applications. Amsterdam: North-Holland, 1987.

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

Jiri, Kvasnicka, ed. A novel approach to optimization of paced AV delay using atrial contribution index. New York: Nova Science Publishers, 2008.

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

Optimal periodic control. Berlin: Springer-Verlag, 1988.

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

Optimization in public transportation: Stop location, delay management and tariff zone design in a public transportation network. New York: Springer, 2006.

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

Lu, Ko Ke. Design of group-delay equalizers and linear-phase filters using minimax optimization. 1986.

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

Schöbel, Anita. Optimization in Public Transportation: Stop Location, Delay Management and Tariff Zone Design in a Public Transportation Network (Springer Optimization and Its Applications). Springer, 2006.

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

United States. National Aeronautics and Space Administration., ed. Process product integrity audits: A hardware auditing technique for the "90s". [Washington, DC: National Aeronautics and Space Administration, 1997.

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

Schöbel, Anita. Optimization in Public Transportation: Stop Location, Delay Management and Tariff Zone Design in a Public Transportation Network (Springer Optimization and Its Applications Book 3). Springer, 2007.

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

Schöbel, Anita. Optimization in Public Transportation: Stop Location, Delay Management and Tariff Zone Design in a Public Transportation Network. Springer, 2010.

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

Modell, Jerome H., and Sean Kiley. Pathophysiology and management of drowning. Oxford University Press, 2016. http://dx.doi.org/10.1093/med/9780199600830.003.0348.

Full text
Abstract:
Drowning is a process beginning with airway submergence under a fluid medium, progressing to aspiration, and ultimately death in the absence of intervention. Aspiration of both fresh- and saltwater can cause pulmonary oedema, decreased compliance, intrapulmonary shunting, and severe hypoxia. Devastating neurological injury resulting from prolonged cerebral hypoxia is proportional to the duration of submersion and delay in effective resuscitation and oxygenation. Victims presenting to the emergency department awake and alert, or even stuporous, are likely to have a good neurological outcome with follow-up intensive care. Those presenting comatose are much more likely to have severe neurological deficits. Keys to survival are: timely rescue from the water, immediate initiation of aggressive supportive care regarding airway, cardiovascular and pulmonary function, and optimization of tissue oxygenation.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Delay optimization"

1

Schmidt, Marie E. "Delay Management." In Springer Optimization and Its Applications, 113–66. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-9566-6_4.

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

Dollevoet, Twan, Dennis Huisman, Marie Schmidt, and Anita Schöbel. "Delay Propagation and Delay Management in Transportation Networks." In Handbook of Optimization in the Railway Industry, 285–317. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-72153-8_13.

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

Flier, Holger, Rati Gelashvili, Thomas Graffagnino, and Marc Nunkesser. "Mining Railway Delay Dependencies in Large-Scale Real-World Delay Data." In Robust and Online Large-Scale Optimization, 354–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-05465-5_15.

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

Kourtev, Ivan S., and Eby G. Friedman. "Signal Delay in VLSI Systems." In Timing Optimization Through Clock Skew Scheduling, 19–41. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4411-1_3.

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

Levi, Itamar, and Alexander Fish. "DML Energy-Delay Tradeoffs and Optimization." In Dual Mode Logic, 75–87. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-40786-5_5.

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

Yang, Chengwei, Ji-Dong Guo, and Jing Chi. "A Dynamic Delay Optimization Scheduling Model." In Lecture Notes in Computer Science, 68–71. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-10831-5_10.

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

Cicerone, Serafino, Gianlorenzo D’Angelo, Gabriele Di Stefano, Daniele Frigioni, and Alfredo Navarra. "Delay Management Problem: Complexity Results and Robust Algorithms." In Combinatorial Optimization and Applications, 458–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-85097-7_43.

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

Liu, Chongyang, and Zhaohua Gong. "Optimal Control of Multistage Time-Delay Systems." In Springer Optimization and Its Applications, 143–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-43793-3_10.

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

Liu, Chongyang, and Zhaohua Gong. "Optimal Control of Switched Time-Delay Systems." In Springer Optimization and Its Applications, 159–75. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-43793-3_11.

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

Jichkar, Bhushan, Deepak Mehetre, and S. Emalda Roslin. "Lifetime and Transport Delay Optimization in Presence of Delay in WSN." In Advances in Intelligent Systems and Computing, 773–89. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-1501-5_68.

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

Conference papers on the topic "Delay optimization"

1

Chakradhar, Srimat T., Sujit Dey, Miodrag Potkonjak, and Steven G. Rothweiler. "Sequential circuit delay optimization using global path delays." In the 30th international. New York, New York, USA: ACM Press, 1993. http://dx.doi.org/10.1145/157485.164991.

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

Slimane, S. B., X. Li, B. Zhou, N. Syed, and M. Abu Dheim. "Delay Optimization in Cooperative Relaying with Cyclic Delay Diversity." In 2008 IEEE International Conference on Communications. IEEE, 2008. http://dx.doi.org/10.1109/icc.2008.668.

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

Mishchenko, Alan, Robert Brayton, Stephen Jang, and Victor Kravets. "Delay optimization using SOP balancing." In 2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD). IEEE, 2011. http://dx.doi.org/10.1109/iccad.2011.6105357.

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

Sen, Rahul, Naushad Manzoor Laskar, K. L. Baishnab, and P. K. Paul. "Optimization of interconnect delay based on Convex Optimization Technique." In 2015 International Conference on Innovations in Information,Embedded and Communication Systems (ICIIECS). IEEE, 2015. http://dx.doi.org/10.1109/iciiecs.2015.7193217.

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

Bernhard Rohfleisch. "Logic Clause Analysis for Delay Optimization." In 32nd Design Automation Conference. ACM, 1995. http://dx.doi.org/10.1109/dac.1995.250048.

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

Bañeres, David, Jordi Cortadella, and Mike Kishinevsky. "Dominator-based partitioning for delay optimization." In the 16th ACM Great Lakes symposium. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1127908.1127927.

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

Chang, Kai-hui, Igor L. Markov, and Valeria Bertacco. "Safe Delay Optimization for Physical Synthesis." In 2007 Asia and South Pacific Design Automation Conference. IEEE, 2007. http://dx.doi.org/10.1109/aspdac.2007.358056.

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

Shih-Jung Hsu and Rung-Bin Lin. "Clock gating optimization with delay-matching." In 2011 Design, Automation & Test in Europe. IEEE, 2011. http://dx.doi.org/10.1109/date.2011.5763106.

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

Patil, Suvarna, and Geetha R. Chillarge. "Route Optimization in Delay Tolerant Networks." In 2015 International Conference on Computing Communication Control and automation(ICCUBEA). IEEE, 2015. http://dx.doi.org/10.1109/iccubea.2015.57.

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

Hylton, N. M., and A. Shah. "Cardiac delay optimization for MR angiograms." In Proceedings of the Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE, 1988. http://dx.doi.org/10.1109/iembs.1988.94540.

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

Reports on the topic "Delay optimization"

1

Ong, M., T. Houck, B. Kreitzer, R. Paris, G. Vogtlin, and J. Zentler. FLASH X-RAY (FXR) LINEAR INDUCTION ACCELERATOR (LIA) OPTIMIZATION Sensor Delay Correction. Office of Scientific and Technical Information (OSTI), May 2006. http://dx.doi.org/10.2172/899421.

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

Mohammadian, Abolfazl, Amir Bahador Parsa, Homa Taghipour, Amir Davatgari, and Motahare Mohammadi. Best Practice Operation of Reversible Express Lanes for the Kennedy Expressway. Illinois Center for Transportation, September 2021. http://dx.doi.org/10.36501/0197-9191/21-033.

Full text
Abstract:
Reversible lanes in Chicago’s Kennedy Expressway are an available infrastructure that can significantly improve traffic performance; however, a special focus on congestion management is required to improve their operation. This research project aims to evaluate and improve the operation of reversible lanes in the Kennedy Expressway. The Kennedy Expressway is a nearly 18-mile-long freeway in Chicago, Illinois, that connects in the southeast to northwest direction between the West Loop and O’Hare International Airport. There are two approximately 8-mile reversible lanes in the Kennedy Expressway’s median, where I-94 merges into I-90, and there are three entrance gates in each direction of this corridor. The purpose of the reversible lanes is to help the congested direction of the Kennedy Expressway increase its traffic flow and decrease the delay in the whole corridor. Currently, experts in a control location switch the direction of the reversible lanes two to three times per day by observing real-time traffic conditions captured by a traffic surveillance camera. In general, inbound gates are opened and outbound gates are closed around midnight because morning traffic is usually heavier toward the central city neighborhoods. In contrast, evening peak-hour traffic is usually heavier toward the outbound direction, so the direction of the reversible lanes is switched from inbound to outbound around noon. This study evaluates the Kennedy Expressway’s current reversing operation. Different indices are generated for the corridor to measure the reversible lanes’ performance, and a data-driven approach is selected to find the best time to start the operation. Subsequently, real-time and offline instruction for the operation of the reversible lanes is provided through employing deep learning and statistical techniques. In addition, an offline timetable is also provided through an optimization technique. Eventually, integration of the data-driven and optimization techniques results in the best practice operation of the reversible lanes.
APA, Harvard, Vancouver, ISO, and other styles
3

Aguayo Navarrete, Estanislao, Richard T. Kouzes, John L. Orrell, Douglas J. Reid, and James E. Fast. Optimization of the Transport Shield for Neutrinoless Double Beta-decay Enriched Germanium. Office of Scientific and Technical Information (OSTI), April 2012. http://dx.doi.org/10.2172/1039848.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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