Search results for "LIFO"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
116	Mainak Chaudhuri	Pseudo-LIFO: the foundation of a new family of replacement policies for last-level caches.	MICRO	2009	DBLP DOI BibTeX RDF	chip-multiprocessor, replacement policy, last-level cache
91	Lars W. Hagen, Dennis J.-H. Huang, Andrew B. Kahng	On implementation choices for iterative improvement partitioning algorithms.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1997	DBLP DOI BibTeX RDF
62	Vipul Mathur, Varsha Apte	An overhead and resource contention aware analytical model for overloaded web servers.	WOSP	2007	DBLP DOI BibTeX RDF	model, Markov chain, queueing theory, web server, resource sharing, overload, analytical, LIFO
62	Ilias Iliadis, Steve W. Fuhrmann	Moment relationships for queues with Poisson input.	Queueing Syst. Theory Appl.	1992	DBLP DOI BibTeX RDF	server vacations, priorities, Moments, polling, FIFO, LIFO
44	Po-Kai Huang, Cheng-Shang Chang, Jay Cheng, Duan-Shin Lee	Recursive Constructions of Parallel FIFO and LIFO Queues With Switched Delay Lines.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
44	Y. Morihiro, T. Toneda	Formal verification of data-path circuits based on symbolic simulation.	Asian Test Symposium	2000	DBLP DOI BibTeX RDF	data-path circuits, symbolic values, transition relation extraction, state graph, input vector sequences, FIFO circuits, LIFO circuits, formal verification, formal verification, graph theory, specification, logic simulation, logic simulation, symbol manipulation, symbolic simulation, Unix workstation
44	Chia-Li Wang, Ronald W. Wolff	The M/G/c queue in light traffic.	Queueing Syst. Theory Appl.	1998	DBLP DOI BibTeX RDF	M/G/c queues, light traffic limit theorems, single crossing, preemptive LIFO, work in system, approximations, bounds
36	Matthew Fluet, Greg Morrisett, Amal J. Ahmed 0001	Linear Regions Are All You Need.	ESOP	2006	DBLP DOI BibTeX RDF
36	Olivier Beaumont, Loris Marchal, Yves Robert	Scheduling Divisible Loads with Return Messages on Heterogeneous Master-Worker Platforms.	HiPC	2005	DBLP DOI BibTeX RDF
36	Luca Breveglieri, Alessandra Cherubini, Stefano Crespi-Reghizzi	Deterministic Parsing for Augmented Context-free Grammars.	MFCS	1995	DBLP DOI BibTeX RDF
26	Xiaofeng Xu, Zhifei Wei	Dynamic pickup and delivery problem with transshipments and LIFO constraints.	Comput. Ind. Eng.	2023	DBLP DOI BibTeX RDF
26	Ulrich Pferschy, Julia Resch, Giovanni Righini	Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs.	J. Sched.	2023	DBLP DOI BibTeX RDF
26	Steven Finch	M/D/1 Queues with LIFO and SIRO Policies.	CoRR	2022	DBLP DOI BibTeX RDF
26	Enzo Baccarelli, Michele Scarpiniti, Alireza Momenzadeh, Sima Sarv Ahrabi	Learning-in-the-Fog (LiFo): Deep Learning Meets Fog Computing for the Minimum-Energy Distributed Early-Exit of Inference in Delay-Critical IoT Realms.	IEEE Access	2021	DBLP DOI BibTeX RDF
26	Maury Bramson	Instability of LIFO queueing networks.	Queueing Syst. Theory Appl.	2021	DBLP DOI BibTeX RDF
26	Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Julia Resch, Giovanni Righini	Optimally rescheduling jobs with a LIFO buffer.	CoRR	2021	DBLP BibTeX RDF
26	Bo Peng 0010, Yuan Zhang, Zhipeng Lü, T. C. E. Cheng, Fred W. Glover	A learning-based memetic algorithm for the multiple vehicle pickup and delivery problem with LIFO loading.	Comput. Ind. Eng.	2020	DBLP DOI BibTeX RDF
26	Yair Liberman, Uri Yechiali	Quality-Dependent Stochastic Networks: Is FIFO Always Better Than LIFO?	VALUETOOLS	2020	DBLP DOI BibTeX RDF
26	Fagui Liu, Mengke Gui, Chen Yi, Yulin Lan	A Fast Decomposition and Reconstruction Framework for the Pickup and Delivery Problem With Time Windows and LIFO Loading.	IEEE Access	2019	DBLP DOI BibTeX RDF
26	Illés Horváth, Rostislav Razumchik, Miklós Telek	The resampling M/G/1 non-preemptive LIFO queue and its application to systems with uncertain service time.	Perform. Evaluation	2019	DBLP DOI BibTeX RDF
26	Luis Sermeño, Jimmy Orellana, Juan Eyzaguirre, Carlos Raymundo	Improvement of Attention Times and Efficiency of Container Movements in a Port Terminal Using a Truck Appointment System, LIFO Management and Poka Yoke.	IHIET	2019	DBLP DOI BibTeX RDF
26	Feng Zhang, Bin Li 0025, Kun Qian	A Grouping Genetic Algorithm Based on the GES Local Search for Pickup and Delivery Problem with Time Windows and LIFO Loading.	ICIC (2)	2018	DBLP DOI BibTeX RDF
26	Søren Asmussen, Peter W. Glynn	On preemptive-repeat LIFO queues.	Queueing Syst. Theory Appl.	2017	DBLP DOI BibTeX RDF
26	Rostislav Razumchik, Miklós Telek	Delay Analysis of Resequencing Buffer in Markov Environment with HOQ-FIFO-LIFO Policy.	EPEW	2017	DBLP DOI BibTeX RDF
26	Alexander N. Dudin, Valentina I. Klimenok, Konstantin E. Samouylov	Stationary Distribution of Waiting Time in MAP/G/1/N Queueing System with LIFO Service Discipline.	WWIC	2017	DBLP DOI BibTeX RDF
26	Wei Si, David Starobinski, Morteza Hashemi, Moshe Laifenfeld, Ari Trachtenberg	Channel Sensitivity of LIFO-Backpressure: Quirks and Improvements.	IEEE Trans. Control. Netw. Syst.	2016	DBLP DOI BibTeX RDF
26	Shih-Chun Lin, Pu Wang 0001, Ian F. Akyildiz, Min Luo 0001	Throughput-Optimal LIFO Policy for Bounded Delay in the Presence of Heavy-Tailed Traffic.	GLOBECOM	2016	DBLP DOI BibTeX RDF
26	Marilène Cherkesly, Guy Desaulniers, Gilbert Laporte	A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading.	Comput. Oper. Res.	2015	DBLP DOI BibTeX RDF
26	Enrique Benavent, Mercedes Landete, Enrique Mota, Gregorio Tirado	The multiple vehicle pickup and delivery problem with LIFO constraints.	Eur. J. Oper. Res.	2015	DBLP DOI BibTeX RDF
26	Lijun Wei, Hu Qin, Wenbin Zhu, Long Wan	A study of perturbation operators for the pickup and delivery traveling salesman problem with LIFO or FIFO loading.	J. Heuristics	2015	DBLP DOI BibTeX RDF
26	Vicente Casares Giner, Víctor-M. Sempere-Payá, David Todolí Ferrandis	Framed ALOHA Protocol with FIFO-Blocking and LIFO-Push out Discipline.	Netw. Protoc. Algorithms	2014	DBLP DOI BibTeX RDF
26	Andrew V. Sokolov, A. V. Drac	The linked list representation of n LIFO-stacks and/or FIFO-queues in the single-level memory.	Inf. Process. Lett.	2013	DBLP DOI BibTeX RDF
26	Longbo Huang, Scott Moeller, Michael J. Neely, Bhaskar Krishnamachari	LIFO-Backpressure Achieves Near-Optimal Utility-Delay Tradeoff.	IEEE/ACM Trans. Netw.	2013	DBLP DOI BibTeX RDF
26	Wei Si, David Starobinski	On the channel-sensitive delay behavior of LIFO-backpressure.	Allerton	2013	DBLP DOI BibTeX RDF
26	Archontia C. Giannopoulou, Paul Hunter, Dimitrios M. Thilikos	LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth.	Discret. Appl. Math.	2012	DBLP DOI BibTeX RDF
26	Archontia C. Giannopoulou, Dimitrios M. Thilikos	A min-max theorem for LIFO-search.	Electron. Notes Discret. Math.	2011	DBLP DOI BibTeX RDF
26	Paul Hunter	LIFO-search on digraphs: A searching game for cycle-rank	CoRR	2011	DBLP BibTeX RDF
26	Yongquan Li, Andrew Lim 0001, Wee-Chong Oon, Hu Qin, Dejian Tu	The tree representation for the pickup and delivery traveling salesman problem with LIFO loading.	Eur. J. Oper. Res.	2011	DBLP DOI BibTeX RDF
26	Xiaoliang Wang 0001, Xiaohong Jiang 0001, Achille Pattavina	Efficient Designs of Optical LIFO Buffer with Switches and Fiber Delay Lines.	IEEE Trans. Commun.	2011	DBLP DOI BibTeX RDF
26	Xiaoliang Wang 0001, Xiaohong Jiang 0001, Achille Pattavina	An improved design of optical LIFO buffer with switched delay lines.	HPSR	2011	DBLP DOI BibTeX RDF
26	Paul Hunter	LIFO-Search on Digraphs: A Searching Game for Cycle-Rank.	FCT	2011	DBLP DOI BibTeX RDF
26	Xiang Gao, Andrew Lim 0001, Hu Qin, Wenbin Zhu	Multiple Pickup and Delivery TSP with LIFO and Distance Constraints: A VNS Approach.	IEA/AIE (2)	2011	DBLP DOI BibTeX RDF
26	Longbo Huang, Scott Moeller, Michael J. Neely, Bhaskar Krishnamachari	LIFO-Backpressure achieves near optimal utility-delay tradeoff.	WiOpt	2011	DBLP DOI BibTeX RDF
26	Jean-François Cordeau, Manuel Iori, Gilbert Laporte, Juan José Salazar González	A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading.	Networks	2010	DBLP DOI BibTeX RDF
26	Alexander Pechinkin, Sergey Shorgin	A Geom/G/1/n Queueing System with LIFO Discipline, Service Interruptions and Repeat Again Service, and Restrictions on the Total Volume of Demands.	MACOM	2010	DBLP DOI BibTeX RDF
26	Dejian Tu, Songshan Guo, Hu Qin, Wee-Chong Oon, Andrew Lim 0001	The Tree Representation of Feasible Solutions for the TSP with Pickup and Delivery and LIFO Loading.	AAAI	2010	DBLP DOI BibTeX RDF
26	Cheng-Shang Chang, Jay Cheng, Duan-Shin Lee	SDL Constructions of FIFO, LIFO and Absolute Contractors.	INFOCOM	2009	DBLP DOI BibTeX RDF
26	Francesco Carrabs, Jean-François Cordeau, Gilbert Laporte	Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading.	INFORMS J. Comput.	2007	DBLP DOI BibTeX RDF
26	Francesco Carrabs, Raffaele Cerulli, Jean-François Cordeau	An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading.	INFOR Inf. Syst. Oper. Res.	2007	DBLP DOI BibTeX RDF
26	Naresh Singhmar, Vipul Mathur, Varsha Apte, D. Manjunath	A Combined LIFO-Priority Scheme for Overload Control of E-commerce Web Servers	CoRR	2006	DBLP BibTeX RDF
26	Gregory Levitin, R. Abezgaouz	Optimal routing of multiple-load AGV subject to LIFO loading constraints.	Comput. Oper. Res.	2003	DBLP DOI BibTeX RDF
26	Yong-Wu Zhou, Shanlin Yang	An optimal replenishment policy for items with inventory-level-dependent demand and fixed lifetime under the LIFO policy.	J. Oper. Res. Soc.	2003	DBLP DOI BibTeX RDF
26	Atsushi Hashimoto 0004, J. Kim, Yoshinao Aoki, Alexander Burger	A proposal of avatar language with Lifo for communication through linguistic barrier.	ICECS	1999	DBLP DOI BibTeX RDF
26	Joseph Abate, Ward Whitt	Limits and approximations for the M/G/1 LIFO waiting-time distribution.	Oper. Res. Lett.	1997	DBLP DOI BibTeX RDF
26	Joseph Abate, Gagan L. Choudhury, Ward Whitt	Calculating the M/G/1 busy-period density and LIFO waiting-time distribution by direct numerical transform inversion.	Oper. Res. Lett.	1995	DBLP DOI BibTeX RDF
26	Eitan Rosenberg, Uri Yechiali	The Mx/G/1 queue with single and multiple vacations under the LIFO service regime.	Oper. Res. Lett.	1993	DBLP DOI BibTeX RDF
26	Mireille Ducassé, Gérard Ferrand (eds.)	Proceedings of the ICLP 1991 Workshop on Logic Programming Environments, Paris, June 1991. Technical Report, University of Orléans, France, LIFO N 91-6	LPE	1991	DBLP BibTeX RDF
26	José Paulo Leal, Luís Damas, Nelma Moreira	An History Based Interface.	LPE	1991	DBLP BibTeX RDF
26	Mireille Ducassé	Analysis of Failing Prolog Executions.	LPE	1991	DBLP BibTeX RDF
26	Michel Rueher	Revisiting Capabilities of Graphic for Logic Programming.	LPE	1991	DBLP BibTeX RDF
26	Santos Gerardo Lazzeri	VIZZPROL: A Tool for Visualizing Prolog Programs.	LPE	1991	DBLP BibTeX RDF
26	Rajiv Trehan	A Process Based Tracer for KL1 on PIM.	LPE	1991	DBLP BibTeX RDF
26	Kurt VanLehn, William Ball, Bernadette Kowalski	Non-LIFO Execution of Cognitive Procedures.	Cogn. Sci.	1989	DBLP DOI BibTeX RDF
26	Shun-Chen Niu	Representing Workloads in GI/G/1 Queues Through the Preemptive-Resume LIFO Queue Discipline.	Queueing Syst. Theory Appl.	1988	DBLP DOI BibTeX RDF
26	Stefano Pallottino, Tommaso Toffoli	An Efficient Algorithm for Determining the Length of the Longest Dead Path in a "LIFO" Branch-and-Bound Exploration Schema.	ACM Trans. Math. Softw.	1981	DBLP DOI BibTeX RDF
26	Morris A. Cohen, Gregory P. Prastacos	Critical number ordering policy for LIFO perishable inventory systems.	Comput. Oper. Res.	1981	DBLP DOI BibTeX RDF
26	Wolfgang Panny	Ein LIFO Branch and Bound Verfahren zur optimalen Altstoffbehälterallokation.	Z. Oper. Research	1981	DBLP DOI BibTeX RDF
26	Paul E. Peters	Delays for a LIFO Queue with Constant Service Time.	Oper. Res.	1968	DBLP DOI BibTeX RDF
26	Jo C. Ebergen, Daniel F. Finchelstein, Russell Kao, Jon K. Lexau, David Hopkins 0001	An Evaluation of Asynchronous Stacks.	IEEE Des. Test Comput.	2011	DBLP DOI BibTeX RDF	static-energy consumption, dynamic-energy consumption, asynchronous circuits, stack, design and test, LIFO
26	Steve W. Fuhrmann, Ilias Iliadis	A comparison of three random disciplines.	Queueing Syst. Theory Appl.	1994	DBLP DOI BibTeX RDF	ROS, queueing disciplines, second moments, FIFO, disciplines, service disciplines, LIFO
26	François Baccelli, Zhen Liu 0001, Donald F. Towsley	Extremal Scheduling of Parallel Processing with and without Real-Time Constraints.	J. ACM	1993	DBLP DOI BibTeX RDF	LCFS, Schur convex ordering, convex ordering, convex symmetric ordering, extremal policy, local order preserving, longest due time first, shortest due time first, parallel processing, throughput, response time, precedence constraints, FIFO, real-time constraints, optimal scheduling, dateness, stochastic ordering, FCFS, LIFO
26	Donald M. Topkis	All-to-All Broadcast by Flooding in Communications Networks.	IEEE Trans. Computers	1989	DBLP DOI BibTeX RDF	worst-case time complexity, simultaneous broadcast, suboptimality, spanning subtree, computational complexity, computer networks, communications networks, adaptive routing, flooding, FIFO, ARPANET, all-to-all broadcast, LIFO
26	Werner E. Kluge	Data File Management in Shift Register Memories.	ACM Trans. Database Syst.	1978	DBLP DOI BibTeX RDF	LIFO/FIFO operation modes, management of sequentially organized files, record retrieval, updating, insertion, data transformations, deletion, relocation, shift-register memories
18	Scott Moeller, Avinash Sridharan, Bhaskar Krishnamachari, Omprakash Gnawali	Routing without routes: the backpressure collection protocol.	IPSN	2010	DBLP DOI BibTeX RDF	stochastic network optimization, testbed experiments, wireless sensor networks, routing protocol, collection
18	Maury Bramson, Yi Lu 0001, Balaji Prabhakar	Randomized load balancing with general service time distributions.	SIGMETRICS	2010	DBLP DOI BibTeX RDF	asymptotic independence, load balancing, randomized algorithms
18	Sophie Toulouse, Roberto Wolfler Calvo	On the Complexity of the Multiple Stack TSP, kSTSP.	TAMC	2009	DBLP DOI BibTeX RDF
18	Maged M. Michael, Martin T. Vechev, Vijay A. Saraswat	Idempotent work stealing.	PPoPP	2009	DBLP DOI BibTeX RDF	memory barrier, memory fence, atomic, work stealing
18	Jay Cheng	Constructions of Optical 2-to-1 FIFO Multiplexers With a Limited Number of Recirculations.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
18	Vijay Erramilli, Mark Crovella	Forwarding in opportunistic networks with resource constraints.	Challenged Networks	2008	DBLP DOI BibTeX RDF	mobile opportunistic networks, delay tolerant networks, pocket switched networks, forwarding algorithms
18	Andrei Paun, Mihaela Paun, Alfonso Rodríguez-Patón	Hopcroft's Minimization Technique: Queues or Stacks?.	CIAA	2008	DBLP DOI BibTeX RDF
18	Abhay Ghatpande, Hidenori Nakazato, Hiroshi Watanabe, Olivier Beaumont	Divisible Load Scheduling with Result Collection on Heterogeneous Systems.	IPDPS	2008	DBLP DOI BibTeX RDF
18	Oleg Kiselyov, Chung-chieh Shan	Lightweight monadic regions.	Haskell	2008	DBLP DOI BibTeX RDF	resource management, type systems, subtyping, monads, regions, type classes, parametric polymorphism, effect systems
18	Natalie M. Steiger, Emily K. Lada, James R. Wilson	Performance evaluation of ASAP3 for steady-state output analysis.	WSC	2005	DBLP DOI BibTeX RDF
18	Wen-Ta Lee, San-Ho Lin, Chia-Chun Tsai, Trong-Yen Lee, Yuh-Shyan Hwang	A new low-power turbo decoder using HDA-DHDD stopping iteration.	ISCAS (2)	2005	DBLP DOI BibTeX RDF
18	Mark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit	Using elimination to implement scalable and lock-free FIFO queues.	SPAA	2005	DBLP DOI BibTeX RDF	scalability, multiprocessors, lock-free, linearizability, nonblocking synchronization, FIFO queues, elimination
18	R. Radhakrishna Pillai	A distributed overload control algorithm for delay-bounded call setup.	IEEE/ACM Trans. Netw.	2001	DBLP DOI BibTeX RDF	Call overload control, signaling performance, distributed algorithm, communication networks
18	Joonyoung Kim, Jesse Whittemore, Karem A. Sakallah	On Solving Stack-Based Incremental Satisfiability Problems.	ICCD	2000	DBLP DOI BibTeX RDF
18	Ioannis Caragiannis, Christos Kaklamanis, Ioannis Vergados	Greedy Dynamic Hot-Potato Routing on Arrays.	ISPAN	2000	DBLP DOI BibTeX RDF
18	Luca Breveglieri, Stefano Crespi-Reghizzi, Alessandra Cherubini	Modeling Operating Systems Schedulers with Multi-Stack-Queue Grammars.	FCT	1999	DBLP DOI BibTeX RDF
18	Jan Jonsson, Kang G. Shin	A Parametrized Branch-and-Bound Strategy for Scheduling Precedence-Constrained Tasks on a Multiprocessor System.	ICPP	1997	DBLP DOI BibTeX RDF	real-time scheduling precedence-constrained tasks, branch-and-bound strategy, multiprocessor systems, hard real-time systems
18	Henry G. Baker	CONS should not CONS its arguments, or, a lazy alloc is a smart alloc.	ACM SIGPLAN Notices	1992	DBLP DOI BibTeX RDF
18	Adam Rifkin	The utility of foresight in single server scheduling.	ACM Southeast Regional Conference	1992	DBLP DOI BibTeX RDF	discrete-event simulation, scheduling theory, single server queue
18	J. Eliot B. Moss	Managing stack frames in Smalltalk.	PLDI	1987	DBLP DOI BibTeX RDF	Smalltalk
18	Ana R. Cavalli	A method of automatic proof for the specification and verification of protocols.	Comput. Commun. Rev.	1984	DBLP DOI BibTeX RDF	Automatic proofs, Protocols, Specifications, Temporal logic, Safety, Queue, Resolution, Liveness