Search results for "Competitive ratio"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Xiaotie Deng	Competitive Ratio for Portfolio Management.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Unknown information, Algorithms, Competitive ratio, Portfolio management
2	Jivitej S. Chadha, Naveen Garg, Amit Kumar, V. N. Muralidhara	A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation.	STOC	2009	DBLP DOI BibTeX RDF	scheduling, approximation algorithms, competitive ratio, flow-time
2	Jihuan Ding, Guochuan Zhang	A Note on Online Scheduling for Jobs with Arbitrary Release Times.	COCOA	2009	DBLP DOI BibTeX RDF	Identical parallel machines, Makespan, Competitive ratio, On-line scheduling
2	Deshi Ye, Xin Han, Guochuan Zhang	A note on online strip packing.	J. Comb. Optim.	2009	DBLP DOI BibTeX RDF	Online algorithms, Competitive ratio, Strip packing
2	Ruyan Fu, Ji Tian, Jinjiang Yuan	On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs.	J. Scheduling	2009	DBLP DOI BibTeX RDF	Job families, Competitive ratio, On-line scheduling, Batch machine
2	Dimitris Fotakis	On the Competitive Ratio for Online Facility Location.	Algorithmica	2008	DBLP DOI BibTeX RDF	Metric facility location, Online algorithms, Competitive analysis
2	Shuichi Miyazaki, Kazuya Okamoto	Improving the Competitive Ratio of the Online OVSF Code Assignment Problem.	ISAAC	2008	DBLP DOI BibTeX RDF
2	Keqin Li	Experimental average-case performance evaluation of online algorithms for routing and wavelength assignment and throughput maximization in WDM optical networks.	ACM Journal of Experimental Algorithmics	2008	DBLP DOI BibTeX RDF	Average-case performance, routing, online algorithm, optical network, wavelength division multiplexing, competitive ratio, wavelength assignment
2	Chun-Lin Xin, Wei-Min Ma, Lei Yang	Competitive Analysis of Two Special Online Device Replacement Problems.	J. Comput. Sci. Technol.	2008	DBLP DOI BibTeX RDF	device replacement, online algorithm, competitive analysis, competitive ratio
2	Koji Kobayashi, Kazuya Okamoto	Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling.	ESA	2007	DBLP DOI BibTeX RDF
2	Nicholas B. Chang, Mingyan Liu	Controlled flooding search in a large network.	IEEE/ACM Trans. Netw.	2007	DBLP DOI BibTeX RDF	best worst-case performance, controlled flooding search, query and search, wireless networks, competitive ratio, time-to-live (TTL), randomized strategy
2	David Ilcinkas, Nicolas Nisse, David Soguet	The Cost of Monotonicity in Distributed Graph Searching.	OPODIS	2007	DBLP DOI BibTeX RDF	Monotonicity, Competitive ratio, Graph searching
2	Rongheng Li, Huei Chuen Huang	List scheduling for jobs with arbitrary release times and similar lengths.	J. Scheduling	2007	DBLP DOI BibTeX RDF	Makespan, Competitive ratio, List scheduling, On-line scheduling
2	Alexander Souza, Angelika Steger	The Expected Competitive Ratio for Weighted Completion Time Scheduling.	Theory Comput. Syst.	2006	DBLP DOI BibTeX RDF
2	Ferdinando Cicalese, Eduardo Sany Laber	On the competitive ratio of evaluating priced functions.	SODA	2006	DBLP DOI BibTeX RDF
2	Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer	Online Single Machine Batch Scheduling.	MFCS	2006	DBLP DOI BibTeX RDF	Scheduling, competitive ratio, batching, online analysis
2	Amrinder Arora, Fanchun Jin, Hyeong-Ah Choi	Optimized Channel Utilization in Multi-carrier Wireless Mobile Networks.	WASA	2006	DBLP DOI BibTeX RDF	offline optimal algorithm, predictive scheduling, Wireless networks, competitive ratio, online scheduling, link adaptation, throughput maximization
2	Z. Y. Tan, S. J. Cao	Semi-online Machine Covering on Two Uniform Machines with Known Total Size.	Computing	2006	DBLP DOI BibTeX RDF	Scheduling, competitive ratio, design and analysis of algorithm
2	Yiwei Jiang, Yong He	Semi-Online Algorithms for Scheduling with Machine Cost.	J. Comput. Sci. Technol.	2006	DBLP DOI BibTeX RDF	semi-online, machine cost, competitive ratio, preemptive scheduling
2	Uriel Feige, Abraham Flaxman, Jason D. Hartline, Robert D. Kleinberg	On the Competitive Ratio of the Random Sampling Auction.	WINE	2005	DBLP DOI BibTeX RDF
2	Yossi Azar, Yossi Richter	Management of Multi-Queue Switches in QoS Networks.	Algorithmica	2005	DBLP DOI BibTeX RDF	Multi-queue switch, Quality of Service, Packet switching, Buffer management, Competitiveness, On-line algorithms, Competitive ratio
2	Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin, Michael E. Saks	A Lower Bound on the Competitive Ratio of Truthful Auctions.	STACS	2004	DBLP DOI BibTeX RDF
2	Alexander Souza, Angelika Steger	The Expected Competitive Ratio for Weighted Completion Time Scheduling.	STACS	2004	DBLP DOI BibTeX RDF
2	Jeff Edmonds	On the Competitiveness of AIMD-TCP within a General Network.	LATIN	2004	DBLP DOI BibTeX RDF	online competitive ratio, multi-bottleneck, TCP, fairness, flow time, AIMD
2	Dimitris Fotakis	On the Competitive Ratio for Online Facility Location.	ICALP	2003	DBLP DOI BibTeX RDF
2	Satoshi Fujita	A Semi-dynamic Multiprocessor Scheduling Algorithm with an Asymptotically Optimal Competitive Ratio.	Euro-Par	2002	DBLP DOI BibTeX RDF
2	Mahesh Kallahalla, Peter J. Varman	PC-OPT: Optimal Offline Prefetching and Caching for Parallel I/O Systems.	IEEE Trans. Computers	2002	DBLP DOI BibTeX RDF	offline algorithm, scheduling, algorithms, caching, prefetching, online algorithm, buffer management, competitive ratio, Parallel I/O systems
2	János Csirik, Csanád Imreh, John Noga, Steven S. Seiden, Gerhard J. Woeginger	Buying a Constant Competitive Ratio for Paging.	ESA	2001	DBLP DOI BibTeX RDF
2	Yair Bartal, Elias Koutsoupias	On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem.	STACS	2000	DBLP DOI BibTeX RDF
2	Joan Boyar, Kim S. Larsen, Morten N. Nielsen	The Accommodating Function - A Generalization of the Competitive Ratio.	WADS	1999	DBLP DOI BibTeX RDF
2	Peter J. Varman, Rakesh M. Verma	Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems.	IEEE Trans. Parallel Distrib. Syst.	1999	DBLP DOI BibTeX RDF	multiple-disk systems, algorithms, caching, prefetching, Parallel I/O, buffer management, competitive ratio, external memory
2	Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén	On Capital Investment.	Algorithmica	1999	DBLP DOI BibTeX RDF	On-line financial problems, On-line algorithms, Competitive ratio
2	Bala Kalyanasundaram, Kirk Pruhs	Minimizing Flow Time Nonclairvoyantly.	FOCS	1997	DBLP DOI BibTeX RDF	flow time minimization, dynamically arriving jobs, unknown execution times, average response/flow time, classic CPU scheduling problem, time sharing operating systems, standard 3-field scheduling notation, nonclairvoyant version, randomized nonclairvoyant algorithm, RMLF, multi level feedback algorithm, deterministic nonclairvoyant algorithm, scheduling, minimisation, competitive ratio, Unix operating system, adaptive adversary
2	Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer	Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling (Extended Abstract)	FOCS	1992	DBLP DOI BibTeX RDF	vertex isoperimetric problem, mobile user tracking, distributed job scheduling, maximum job delay, combinatorial techniques, distributed algorithm, hypercube, linear algebra, competitive ratio, expanding graph, harmonic analysis
1	Elisabeth Günther, Olaf Maurer, Nicole Megow, Andreas Wiese	A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio	CoRR	2012	DBLP BibTeX RDF
1	Sourav Chakraborty, Oded Lachish	Improved competitive ratio for the matroid secretary problem.	SODA	2012	DBLP BibTeX RDF
1	Antoine Musitelli, Jean-Marc Nicoletti	Competitive ratio of List Scheduling on uniform machines and randomized heuristics.	J. Scheduling	2011	DBLP DOI BibTeX RDF
1	Ferdinando Cicalese, Eduardo Sany Laber	On the competitive ratio of evaluating priced functions.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Rahul Vaze	Competitive Ratio Analysis of Online Algorithms to Minimize Data Transmission Time in Energy Harvesting Communication System	CoRR	2011	DBLP BibTeX RDF
1	Hiroshi Fujiwara, Takuma Kitano, Toshihiro Fujito	On the Best Possible Competitive Ratio for Multislope Ski Rental.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Elias Koutsoupias, George Pierrakos	On the Competitive Ratio of Online Sampling Auctions.	WINE	2010	DBLP DOI BibTeX RDF
1	Yuval Emek, Magnús M. Halldórsson, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, Dror Rawitz	Online set packing and competitive scheduling of multi-part tasks.	PODC	2010	DBLP DOI BibTeX RDF	multi-packet frames, online set packing, packet fragmentation, competitive analysis
1	Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking	Online capacity maximization in wireless networks.	SPAA	2010	DBLP DOI BibTeX RDF	online algorithms, competitive analysis, physical model, sinr
1	Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga	A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs	CoRR	2009	DBLP BibTeX RDF
1	Sourav Chakraborty, Nikhil R. Devanur	An Online Multi-unit Auction with Improved Competitive Ratio	CoRR	2009	DBLP BibTeX RDF
1	Shuichi Miyazaki, Kazuya Okamoto	Improving the Competitive Ratio of the Online OVSF Code Assignment Problem.	Algorithms	2009	DBLP DOI BibTeX RDF
1	Sourav Chakraborty, Nikhil R. Devanur	An Online Multi-unit Auction with Improved Competitive Ratio.	WINE	2009	DBLP DOI BibTeX RDF
1	Ping Xu, Xiang-Yang Li	Online market driven spectrum scheduling and auction.	MOBICOM-CoRoNet	2009	DBLP DOI BibTeX RDF	wireless networks, competitive ratio, preemption, online scheduling, spectrum, penalty
1	Yinfeng Xu, Wenming Zhang, Feifeng Zheng	Optimal Algorithms for the Online Time Series Search Problem.	COCOA	2009	DBLP DOI BibTeX RDF	Time Series Search, Profit Function, Online Algorithm, Competitive Ratio
1	Zhenbo Wang, Wenxun Xing, Bo Chen	On-line service scheduling.	J. Scheduling	2009	DBLP DOI BibTeX RDF	Service policy evaluation, On-line, Competitive ratio, Parallel machine scheduling
1	Yonatan Cohen, Jaroslav Opatrny	A local algorithm for dominating sets of quasi-unit disk graphs.	C3S2E	2009	DBLP DOI BibTeX RDF	quasi-unit disk graph, tiling, ad-hoc wireless network, local algorithm, dominating set, geometric graph
1	Aleksandar Dragojevic, Rachid Guerraoui, Anmol V. Singh, Vasu Singh	Preventing versus curing: avoiding conflicts in transactional memories.	PODC	2009	DBLP DOI BibTeX RDF	scheduling, contention management, software transactional memory
1	Flavio Chierichetti, Ravi Kumar, Sergei Vassilvitskii	Similarity caching.	PODS	2009	DBLP DOI BibTeX RDF	caching, competitive analysis, nearest-neighbor, buffer management
1	Saeed Alaei, Azarakhsh Malekian, Aravind Srinivasan	On random sampling auctions for digital goods.	ACM Conference on Electronic Commerce	2009	DBLP DOI BibTeX RDF	auction, mechanism design, random sampling
1	Moshe Babaioff, Jason D. Hartline, Robert D. Kleinberg	Selling ad campaigns: online algorithms with cancellations.	ACM Conference on Electronic Commerce	2009	DBLP DOI BibTeX RDF	costly decision revocation, selling advertisements, online algorithms, matroids, knapsack
1	Nikhil R. Devenur, Thomas P. Hayes	The adwords problem: online keyword matching with budgeted bidders under random permutations.	ACM Conference on Electronic Commerce	2009	DBLP DOI BibTeX RDF	adwords, learning, matching, online, random permutation
1	Benjamin Aminof, Orna Kupferman, Robby Lampert	Reasoning about online algorithms with weighted automata.	SODA	2009	DBLP DOI BibTeX RDF
1	Spyros Angelopoulos, Pascal Schweitzer	Paging and list update under bijective analysis.	SODA	2009	DBLP DOI BibTeX RDF
1	Nikhil Bansal, Ho-Leung Chan	Weighted flow time does not admit O(1)-competitive algorithms.	SODA	2009	DBLP DOI BibTeX RDF
1	Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak	Collecting weighted items from a dynamic queue.	SODA	2009	DBLP DOI BibTeX RDF
1	Florin Constantin, Jon Feldman, S. Muthukrishnan, Martin Pál	An online mechanism for ad slot reservations with cancellations.	SODA	2009	DBLP DOI BibTeX RDF
1	Anirban Dasgupta, Arpita Ghosh, Hamid Nazerzadeh, Prabhakar Raghavan	Online story scheduling in web advertising.	SODA	2009	DBLP DOI BibTeX RDF
1	Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra	Buffer management for colored packets with deadlines.	SPAA	2009	DBLP DOI BibTeX RDF	dram scheduling, online algorithms, buffer management, packets scheduling, earliest deadline first
1	Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs	Speed scaling of processes with arbitrary speedup curves on a multiprocessor.	SPAA	2009	DBLP DOI BibTeX RDF	scheduling, speed scaling
1	Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe	Competitive buffer management for multi-queue switches in qos networks using packet buffering algorithms.	SPAA	2009	DBLP DOI BibTeX RDF	multi-queue switches, competitive analysis, buffer management
1	Jan Mehler, Friedhelm Meyer auf der Heide	Power-aware online file allocation in mobile ad hoc networks: [extended abstract].	SPAA	2009	DBLP DOI BibTeX RDF	mobile ad hoc networks, online algorithms, file allocation, amortized analysis
1	Dmitry Korzun, Andrei Gurtov	A local equilibrium model for P2P resource ranking.	SIGMETRICS Performance Evaluation Review	2009	DBLP DOI BibTeX RDF
1	Bill Lin, Jun (Jim) Xu, Nan Hua, Hao Wang, Haiquan (Chuck) Zhao	A randomized interleaved DRAM architecture for the maintenance of exact statistics counters.	SIGMETRICS Performance Evaluation Review	2009	DBLP DOI BibTeX RDF
1	Alma Riska, Erik Riedel	Evaluation of disk-level workloads at different time scales.	SIGMETRICS Performance Evaluation Review	2009	DBLP DOI BibTeX RDF
1	Sipat Triukose, Zhihua Wen, Michael Rabinovich	Content delivery networks: how big is big enough?	SIGMETRICS Performance Evaluation Review	2009	DBLP DOI BibTeX RDF
1	Rajgopal Kannan, Shuangqing Wei, Costas Busch, Athanasios V. Vasilakos	Online Algorithms for Maximizing Quality of Link Transmissions over a Jammed Wireless Channel.	PerCom Workshops	2009	DBLP DOI BibTeX RDF
1	Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, Alejandro Strejilevich de Loma	Discrete online TSP.	AAIM	2009	DBLP DOI BibTeX RDF	discrete metric spaces, online algorithms, TSP
1	Marek Chrobak, Jiri Sgall	Three Results on Frequency Assignment in Linear Cellular Networks.	AAIM	2009	DBLP DOI BibTeX RDF
1	Fei Li	Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers.	AAIM	2009	DBLP DOI BibTeX RDF
1	Feifeng Zheng, Yinfeng Xu, Chung Keung Poon	On Job Scheduling with Preemption Penalties.	AAIM	2009	DBLP DOI BibTeX RDF
1	Ming Liu, Yinfeng Xu, Chengbin Chu, Lu Wang	Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine.	COCOA	2009	DBLP DOI BibTeX RDF	Makespan, Online scheduling, Batch processing
1	Yuzhong Zhang, Jianfeng Ren, Chengfei Wang	Scheduling with Rejection to Minimize the Makespan.	COCOA	2009	DBLP DOI BibTeX RDF	scheduling with rejection, worst case performance ratio, Approximation algorithm, dynamic programming
1	Guiqing Zhang, Yinfeng Xu	A Risk-Reward Competitive Analysis for the Newsboy Problem with Range Information.	COCOA	2009	DBLP DOI BibTeX RDF
1	Axel Simroth, Alexander Souza	On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis.	COCOON	2009	DBLP DOI BibTeX RDF
1	Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, C. Thach Nguyen	On Revenue Maximization in Second-Price Ad Auctions.	ESA	2009	DBLP DOI BibTeX RDF
1	György Dósa, Leah Epstein	Preemptive Online Scheduling with Reordering.	ESA	2009	DBLP DOI BibTeX RDF
1	David G. Kirkpatrick	Hyperbolic Dovetailing.	ESA	2009	DBLP DOI BibTeX RDF
1	Andrew McGregor, Krzysztof Onak, Rina Panigrahy	The Oil Searching Problem.	ESA	2009	DBLP DOI BibTeX RDF
1	Chien-Min Wang, Xiao-Wei Huang, Chun-Chen Hsu	Bi-objective Optimization: An Online Algorithm for Job Assignment.	GPC	2009	DBLP DOI BibTeX RDF	job assignment, bi-objective optimization, throughput, Online algorithms, load
1	Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy Katz	Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule.	ICALP	2009	DBLP DOI BibTeX RDF
1	Luca Becchetti, Elias Koutsoupias	Competitive Analysis of Aggregate Max in Windowed Streaming.	ICALP	2009	DBLP DOI BibTeX RDF
1	Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén	Online Computation with Advice.	ICALP	2009	DBLP DOI BibTeX RDF
1	Nitish Korula, Martin Pál	Algorithms for Secretary Problems on Graphs and Hypergraphs.	ICALP	2009	DBLP DOI BibTeX RDF
1	Amotz Bar-Noy, Michael Lampis	Online Maximum Directed Cut.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke	On the Advice Complexity of Online Problems.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang	1-Bounded Space Algorithms for 2-Dimensional Bin Packing.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Minkyoung Cho, David M. Mount, Eunhui Park	Maintaining Nets and Net Trees under Incremental Motion.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Xin Han, Kazuhisa Makino	Online Knapsack Problems with Limited Cuts.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Minming Li	Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Bo Zhang, Binoy Ravindran	Brief Announcement: Relay: A Cache-Coherence Protocol for Distributed Transactional Memory.	OPODIS	2009	DBLP DOI BibTeX RDF
1	Hyunwoo Jung, Kyung-Yong Chwa	The Balloon Popping Problem Revisited: Lower and Upper Bounds.	SAGT	2009	DBLP DOI BibTeX RDF	lower bound, auction, upper bound
1	Spyros Angelopoulos	Online Priority Steiner Tree Problems.	WADS	2009	DBLP DOI BibTeX RDF
1	Kamal Al-Bawani, Alexander Souza	Competitive Buffer Management with Stochastic Packet Arrivals.	SEA	2009	DBLP DOI BibTeX RDF
1	Stanislav Angelov, Sanjeev Khanna, Keshav Kunal	The Network as a Storage Device: Dynamic Routing with Bounded Buffers.	Algorithmica	2009	DBLP DOI BibTeX RDF	Troughput maximization, Online algorithms, Network routing
1	Joseph Wun-Tat Chan, Prudence W. H. Wong, Fencol C. C. Yung	On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis.	Algorithmica	2009	DBLP DOI BibTeX RDF