A Unified View of Online Matching and Resource Allocation Problems Whereas small regret online algorithms for applications as diverse network revenue management (NRM), assemble-to-order (ATO) systems, stochastic bin packing (SBP) are known in the literature, design existing tailored to specific application often use strategy resolving a planning linear program. In paper “Greedy Algorithm Multiw...

typographical data entry errors and incomplete documents, produce imperfect records in real world databases. these errors generate distinct records which belong to the same entity. the aim of approximate record matching is to find multiple records which belong to an entity. in this paper, an algorithm for approximate record matching is proposed that can be adapted automatically with input error...

In this paper, we extend the sliding mode idea to a class of unmatched uncertain variable structure systems. This method is achieved with introducing a new terminal sliding variable and the finite time stability of proposed method is proved using a new particular finite time condition in both reaching and sliding phases. In reaching phase new sliding mode controller is derived to guarantee the ...

We present a randomized algorithm which takes as input n distinct points {(xi, yi)}i=1 from F ×F (where F is a field) and integer parameters t and d and returns a list of all univariate polynomials f over F in the variable x of degree at most d which agree with the given set of points in at least t places (i.e., yi = f(xi) for at least t values of i), provided t = Ω( √ nd). The running time is ...

We present a randomized algorithm which takes as input n distinct points {(xi, yi)}i=1 from F × F (where F is a field) and integer parameters t and d and returns a list of all univariate polynomials f over F in the variable x of degree at most d which agree with the given set of points in at least t places (i.e., yi = f(xi) for at least t values of i), provided t = Ω( √ nd). The running time is...