Filters








3,773 Hits in 4.5 sec

Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications

Hu Fu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang, Nikhil Bansal, Emanuela Merelli, James Worrell
2021
In this paper, we study the random order vertex arrival contention resolution scheme for matching in general graphs, which is inspired by the recent work of Ezra et al. (EC 2020).  ...  Our results are the first non-trivial results for random order prophet matching and Price-of-Information matching in general graphs.  ...  I C A L P 2 0 2 1 68:18 Random Order Vertex Arrival Contention Resolution Schemes for Matching The proof of validity for S PoI is similar to the proof for S QC . ▶ Lemma 17.  ... 
doi:10.4230/lipics.icalp.2021.68 fatcat:bw6jogkprvbgddgm2ad7pplhya

Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes [article]

Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan
2021 arXiv   pre-print
We present new ordered contention resolution schemes yielding improved approximation guarantees for some of the foundational problems studied in this area.  ...  When the vertices do not have patience constraints, we describe a 0.432-approximate random order probing algorithm with several corollaries such as an improved guarantee for the Prophet Secretary problem  ...  Using our attenuation for Random-order Contention Resolution Schemes.  ... 
arXiv:2106.06892v1 fatcat:6jt7kbk4frbadncpi4npbe4ydm

Online Stochastic Max-Weight Matching: prophet inequality for vertex and edge arrival models [article]

Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang
2020 arXiv   pre-print
Our algorithms rely on the construction of suitable online contention resolution scheme (OCRS).  ...  We provide prophet inequality algorithms for online weighted matching in general (non-bipartite) graphs, under two well-studied arrival models, namely edge arrival and vertex arrival.  ...  and contention resolution schemes [27] .  ... 
arXiv:2002.09807v2 fatcat:nvoue6y6nbag3nyg3bsk6j27xm

Oblivious Online Contention Resolution Schemes [article]

Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Abner Turkieltaub, Hongxun Wu, Jinzhao Wu, Qianfan Zhang
2021 arXiv   pre-print
Contention resolution schemes (CRSs) are powerful tools for obtaining "ex post feasible" solutions from candidates that are drawn from "ex ante feasible" distributions.  ...  Online contention resolution schemes (OCRSs), the online version, have found myriad applications in Bayesian and stochastic problems, such as prophet inequalities and stochastic probing.  ...  An Online Contention Resolution Scheme (OCRS) with respect to F is a procedure indexed by ex ante feasible solutions x ∈ P F and an arrival order of elements in U .  ... 
arXiv:2111.10607v1 fatcat:fay7xfsq4zgark2wivvw23wa6e

Prophet Matching Meets Probing with Commitment [article]

Allan Borodin, Calum MacRury, Akash Rakheja
2021 arXiv   pre-print
We refer to this setting as the known i.d. stochastic matching problem with random order arrivals.  ...  We refer to this setting as the known i.d. stochastic matching problem with adversarial arrivals. (2) A 1-1/e ratio when the stochastic graph is generated from a known stochastic type graph where the t  ...  Both Lee and Singla [33] , as well as Adamczyk and Wlodarczyk [3] , defined a random order contention resolution scheme (RCRS), which is an OCRS where the elements of [k] arrive in random order.  ... 
arXiv:2102.04325v3 fatcat:l7whuucwu5by7gwxsoehikvl34

Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity [article]

John P. Dickerson and Karthik Abinav Sankararaman and Aravind Srinivasan and Pan Xu
2018 arXiv   pre-print
When a vertex arrives, an irrevocable and immediate decision should be made by the algorithm; either match it to an available vertex or drop it.  ...  In bipartite matching problems, vertices on one side of a bipartite graph are paired with those on the other.  ...  The authors would like to thank the anonymous reviewers for their helpful feedback.  ... 
arXiv:1811.05100v1 fatcat:ovry5rtdmvgytkjegkaqa6hxpi

An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint

Simon Bruggmann, Rico Zenklusen
2020 Mathematical programming  
Our contention resolution scheme for the bipartite case also improves the lower bound on the correlation gap for bipartite matchings.  ...  We suggest a different, polyhedral viewpoint to design contention resolution schemes, which avoids to deal explicitly with the randomization in the second step.  ...  Acknowledgements We are grateful to the anonymous referees for many valuable comments that helped  ... 
doi:10.1007/s10107-020-01570-6 fatcat:2lnmxujlv5aaneiogmfmjo6ese

Resolution of deadlocks in object-oriented distributed systems

M. Roesler, W.A. Burkhard
1989 IEEE transactions on computers  
We propose and prove correct a distributed algorithm for detection and resolutions of resource deadlocks in objectoriented distributed systems.  ...  In order to drastically reduce message traffic, the algorithm properly identifies and eliminates redundant messages.  ...  Komlos for many fruitful suggestions on the average case analysis of the algorithm.  ... 
doi:10.1109/12.30874 fatcat:nilif5rd4ndknbpczlqljgdina

Robust transmission of 3D geometry over lossy networks

Zhihua Chen, Bobby Bodenheimer, J. Fritz Barnes
2003 Proceeding of the eighth international conference on 3D web technology - Web3D '03  
Yet typical mesh compression schemes increase the fragility of the mesh to lossy transmission.  ...  However, multi-user, real-time graphics applications may find TCP transmission disadvantageous when reception of a mesh is time-critical.  ...  There are two traditional methods for obtaining high resolution 3D meshes for these applications: (1) assume that in a traditional client-server model the client already has the model; (2) wait for the  ... 
doi:10.1145/636593.636618 dblp:conf/vrml/ChenBB03 fatcat:goyxfgaarjhy5eqdkfg7usrii4

Approximation Algorithms for Stochastic Combinatorial Optimization Problems

Jian Li, Yu Liu
2016 Journal of the Operations Research Society of China  
designing approximation algorithms for stochastic combinatorial optimization problems, including the linear programming relaxation approach, boosted sampling, content resolution schemes, Poisson approximation  ...  Our discussions are centered around a few representative problems, such as stochastic knapsack, stochastic matching, multi-armed bandit etc.  ...  We apologize in advance for the omission of any important results. We would like to thank Xiaodong Hu for inviting us to write the survey.  ... 
doi:10.1007/s40305-015-0116-9 fatcat:wewxh47vgjgazg3thpbnonreaq

Robust transmission of 3D geometry over lossy networks

Zhihua Chen, Bobby Bodenheimer, J. Fritz Barnes
2003 Proceeding of the eighth international conference on 3D web technology - Web3D '03  
Yet typical mesh compression schemes increase the fragility of the mesh to lossy transmission.  ...  However, multi-user, real-time graphics applications may find TCP transmission disadvantageous when reception of a mesh is time-critical.  ...  There are two traditional methods for obtaining high resolution 3D meshes for these applications: (1) assume that in a traditional client-server model the client already has the model; (2) wait for the  ... 
doi:10.1145/636616.636618 fatcat:2thd4lcc2jbypmrvxbty4jqwcu

Fault Diagnosis with Orthogonal Compactors in Scan-Based Designs

Brady Benware, Grzegorz Mrugalski, Artur Pogiel, Janusz Rajski, Jędrzej Solecki, Jerzy Tyszer
2011 Journal of electronic testing  
The scheme is based on a very simple test response compactor employing orthogonal-spatial and time-signatures.  ...  The advantage of this scheme as compared to previous work in this field is the simple and incremental nature of the compaction hardware required.  ...  In order to improve diagnostic resolution, a two-step scan chain partitioning [20] maintains the principle of random selection of scan chains, but generates additional partitions comprising groups of  ... 
doi:10.1007/s10836-011-5243-6 fatcat:v4pmhdduifgrthgda7vun6s7ma

On the Behavior of Input Queuing Switch Architectures

Marco Ajmone Marsan, Andrea Bianco, Paolo Giaccone, Emilio Leonardi, Fabio Neri, Enrica Filippi
1999 Transactions on Emerging Telecommunications Technologies  
Some have found application in commercial very high speed IP routers.  ...  Performance is measured in terms of cell loss probability, as well as average, standard deviation, and 99-th quantile of the cell delay with different traffic patterns.  ...  The contention resolution typically is either random (random order -RO) or based on a deterministic scheme; in the latter case, we consider round robin (RR) and sequential search (SS), the difference being  ... 
doi:10.1002/ett.4460100203 fatcat:eyo3zk6725eozduwhfjaibbhiq

Browsing and placement of multiresolution images on parallel disks

Sunil Prabhakar, Divyakant Agrawal, Amr El Abbadi, Ambuj Singh, Terrence Smith
1997 Proceedings of the fifth workshop on I/O in parallel and distributed systems - IOPADS '97  
In order to reduce the demands on I/O and network resources, multiresolution representations are being proposed for the storage organization of images.  ...  The original image is represented by several coefficients, one of them with visual similarity to the original image, but at a lower resolution.  ...  -1 neighbors for each vertex.  ... 
doi:10.1145/266220.266230 dblp:conf/iopads/PrabhakarAASS97 fatcat:guinyy2vqrde7hoscdcazuztvu

Resource Allocation for Loss Tolerant Video Streaming in eMBMS [article]

Sadaf ul Zuhra, Prasanna Chaporkar, Abhay Karandikar
2019 arXiv   pre-print
that decodable by the user with the worst channel conditions.  ...  Even though multicast transmission allows to serve multiple users on the same resources, in order to serve all these users successfully, the base station cannot transmit the content at a rate greater than  ...  Matching (MWBM). • We have evaluated the performance of the proposed schemes via extensive simulations.  ... 
arXiv:1903.07904v1 fatcat:2gixex67nrb2fkwus6xqmmcqya
« Previous Showing results 1 — 15 out of 3,773 results