Filters








7,179 Hits in 4.6 sec

Detecting Manipulation in Cup and Round Robin Sports Competitions

T. Russell, Peter Van Beek
2012 2012 IEEE 24th International Conference on Tools with Artificial Intelligence  
We show that it is possible to successfully detect certain patterns of manipulations in cups and round robins, two of the most common types of sports competitions.  ...  The practical benefit of our approach is a tool that can be used by competition organizers to highlight suspicious play within the competition and so aid in the detection of cheating coalitions.  ...  and round robin competitions.  ... 
doi:10.1109/ictai.2012.46 dblp:conf/ictai/RussellB12 fatcat:s5pid7al7rd7xlgqpu6f5np6o4

Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines

Paul C. Bell, Prudence W. H. Wong
2013 Journal of combinatorial optimization  
We propose a deterministic online algorithm for the general setting and show that it is O(log α P )competitive, where P is the ratio of the maximum and minimum job size.  ...  For the multiprocessor setting, constant competitive online algorithms for special cases of unit size jobs or arbitrary size jobs with agreeable deadlines have been proposed [4] .  ...  Dual-Classified Round Robin (DCRR) The Algorithm We now describe our algorithm DCRR (Dual-Classified Round Robin).  ... 
doi:10.1007/s10878-013-9618-8 fatcat:5oad2jfxlrb6pi6gjsvib3d764

Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines [chapter]

Paul C. Bell, Prudence W. H. Wong
2011 Lecture Notes in Computer Science  
We propose a deterministic online algorithm for the general setting and show that it is O(log α P )competitive, where P is the ratio of the maximum and minimum job size.  ...  For the multiprocessor setting, constant competitive online algorithms for special cases of unit size jobs or arbitrary size jobs with agreeable deadlines have been proposed [4] .  ...  Dual-Classified Round Robin (DCRR) The Algorithm We now describe our algorithm DCRR (Dual-Classified Round Robin).  ... 
doi:10.1007/978-3-642-20877-5_4 fatcat:57lw6lkbirgtrgds6junamsvda

Manipulating Tournaments in Cup and Round Robin Competitions [chapter]

Tyrel Russell, Toby Walsh
2009 Lecture Notes in Computer Science  
We show that we can decide how to manipulate round robin and cup competitions, two of the most popular types of sporting competitions in polynomial time.  ...  In sports competitions, teams can manipulate the result by, for instance, throwing games.  ...  We proved that such direct manipulation of the fixed cup and round robin competitions can be computed in polynomial time.  ... 
doi:10.1007/978-3-642-04428-1_3 fatcat:yunbkupvkzeqxg3gmgdamy7x5e

Page 631 of Mathematical Reviews Vol. , Issue 98A [page]

1998 Mathematical Reviews  
For a system of M stations, the solution complexity is of the order of 27”~"). The analysis approach is applicable to both round robin and reverse round robin systems.  ...  The analysis presented is applicable to the class of systems in operations re- search that can be viewed as multiple single buffer queues served by a server in round robin or reverse round robin fashion  ... 

Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness [chapter]

Hisashi Koga
2001 Lecture Notes in Computer Science  
We prove a simple greedy algorithm is Θ(log m)-competitive and nearly optimal, while the ROUND ROBIN scheduling cannot break the trivial upper bound of m-competitiveness.  ...  This new on-line problem is named the balanced scheduling problem (BSP). By competitive analysis, we evaluate the power of on-line algorithms regarding to the prevention of packet losses.  ...  Acknowledgment I would like to thank Susanne Albers for helpful comments on the early version of this paper.  ... 
doi:10.1007/3-540-45678-3_6 fatcat:dr3vac5cergbpnhxeggaretjsa

Online scheduling for delayed mobile offloading

Han Deng, I-Hong Hou
2015 2015 IEEE Conference on Computer Communications (INFOCOM)  
We further study the case where the service provider can increase the capacity of WiFi so as to provide guarantees on the amount of offloaded data.  ...  We study performance of online policies by comparing against the optimal offline policy.  ...  Theoretical analysis only shows that the worst-case performance of our policies is better than that of the round robin policy.  ... 
doi:10.1109/infocom.2015.7218569 dblp:conf/infocom/DengH15 fatcat:cfmx5gbftvcxzha7v3jbgm7sri

Improvised Optimum Multilevel Dynamic Round Robin Algorithm for Optimizing CPU Scheduling

Neetu Goel, R.B. Garg
2015 International Journal of Computer Applications  
In order to simulate the behavior of various CPU scheduling algorithms and to improve Round Robin scheduling algorithm using dynamic time slice concept, we purpose new improved CPU scheduling algorithm  ...  called "Optimum Dynamic Round Robin Scheduling" (OMDRR).  ...  The software was implemented to simulate the operations of FCFS, SJF(Non Preemptive & Preemptive), Highest Priority, Round Robin and Improving of Round Robin scheduling algorithm.  ... 
doi:10.5120/ijca2015905720 fatcat:gvdysjh67zdtpkffnvfvo5w5cu

Dynamic Task Scheduling based on Burst Time Requirement for Cloud Environment

Linz Tom, Bindu V.R.
2021 International Journal of Computer Networks & Communications  
The new approach is formulated on the Round Robin and the Shortest Job First algorithms. The Round Robin method reduces starvation, and the Shortest Job First decreases the average waiting time.  ...  The overall performance of cloud systems is rooted in the efficiency of task scheduling algorithms.  ...  In this proposed method, the authors tried to decrease the number of context switches of the Round Robin algorithm. proposed algorithm, we decreased the number of context switches, and the time for context  ... 
doi:10.5121/ijcnc.2021.13505 fatcat:q7riq5fqqzc6ngt65t5oexhhke

Round Robin with Server Affinity: A VM Load Balancing Algorithm for Cloud Based Infrastructure

Komal Mahajan, Ansuyia Makroo, Deepak Dahiya
2013 Journal of Information Processing Systems  
This problem can be resolved by developing an efficient virtual machine load balancing algorithm for the cloud and by doing a comparative analysis of the proposed algorithm with the existing algorithms  ...  The limitation of the available Virtual Machine Load balancing policies for cloud is that they do not save the state of the previous allocation of a virtual machine to a request from a Userbase and the  ...  Section 7 includes the comparative analysis of the Round Robin and the Round Robin with server affinity VM load balancing algorithms.  ... 
doi:10.3745/jips.2013.9.3.379 fatcat:47h4xmsiejf53kphsoklthmmmi

Three-Phase Tournament-Based Method for Better Email Classification

Sabah Sayed
2012 International Journal of Artificial Intelligence & Applications  
The third phase uses a 2-layer tournament method which applies round robin and elimination tournament methods sequentially to realize the winner class per cluster and the winner of all clusters respectively  ...  The first phase evolves K-mean algorithm to result in cluster sizes of 3, 4, or 5 email classes with the pairwise similarity function.  ...  After each competition, the winner of the two classes remains in the next round competition and the loser is eliminated.  ... 
doi:10.5121/ijaia.2012.3606 fatcat:ftuyrilasfcnpimizyp6aogp6a

Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online Algorithms [article]

Alexander Wei, Fred Zhang
2020 arXiv   pre-print
In this paper, we provide the first set of non-trivial lower bounds for competitive analysis using machine-learned predictions.  ...  We study the problem of improving the performance of online algorithms by incorporating machine-learned predictions.  ...  Acknowledgements We would like to thank Constantinos Daskalakis, Piotr Indyk, and Jelani Nelson for their comments on drafts of this paper.  ... 
arXiv:2010.11443v1 fatcat:vvmqef5zxfh63motrpavbrd46i

Simulation leagues: Enabling replicable and robust investigation of complex robotic systems [article]

David M Budden, Peter Wang, Oliver Obst, Mikhail Prokopenko
2014 arXiv   pre-print
To demonstrate their utility directly, we leverage the ability to run parallelised experiments to evaluate different competition formats (e.g. round robin) for the RoboCup 2D simulation league.  ...  Many of these systems are later transferred to physical robots, making the simulation leagues invaluable well-beyond the scope of simulated soccer matches.  ...  In the following sections, we leverage these properties to expand upon our previous analysis of RoboCup competition formats (e.g. round robin) to determine which best approximates the true performance  ... 
arXiv:1412.5711v1 fatcat:4jz362yovfdqbmetyyfrd3y3vq

Application-Controlled Paging for a Shared Cache

Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vitter
2000 SIAM journal on computing (Print)  
Our competitive ratio improves upon the 2P + 2 competitive ratio achieved by the deterministic application-controlled strategy of Cao, Felten, and Li.  ...  If the P application processes always make good cache replacement decisions, our online application-controlled caching algorithm attains a competitive ratio of 2H P −1 + 2 ∼ 2 ln P .  ...  If algorithm A evicts a page of P i during the first round-robin while servicing a touch of P i , then there will be a page fault during the second round-robin.  ... 
doi:10.1137/s0097539797324278 fatcat:r2xb2ei5trcvflkc6k4kl3q5cm

Predicting Dominance Rankings for Score-Based Games

Spyridon Samothrakis, Diego Perez, Simon M. Lucas, Philipp Rohlfshagen
2016 IEEE Transactions on Computational Intelligence and AI in Games  
We show that Glicko should be the method of choice for online score-based game competitions.  ...  This raises the issue of how best to draw opponents for matches in ongoing competitions, and how best to rank the players in each role.  ...  We would like to thank all participants of the Ms Pac-Man vs Ghosts competitions, many of whom contributed actively towards making the competitions popular.  ... 
doi:10.1109/tciaig.2014.2346242 fatcat:vrglia6dqvdddb3ncsjd2euzpe
« Previous Showing results 1 — 15 out of 7,179 results