نتایج جستجو برای: reservation level tchebycheff procedure rltp

تعداد نتایج: 1630817  

Journal: :Math. Oper. Res. 2005
Luis Fernando Zuluaga Javier Peña

Consider the problem of finding optimal bounds on the expected value of piece-wise polynomials over all measures with a given set of moments. This is a special class ofGeneralized Tchebycheff Inequalities in probability theory. We study this problem within the framework of conic programming. Relying on a general approximation scheme for conic programming, we show that these bounds can be numeri...

2006
Boris Shekhtman Ambikeshwar Sharma

In the first part of the paper we show that the space of polynomials of degree n−1 is the unique n-dimensional Tchebycheff subspace of polynomials. We also define a generalization of Tchebycheff spaces: ”Ideal complements” and demonstrate their uniqueness. In the second part we discuss various analogues of Tchebycheff spaces (minimal interpolating systems) in several variables. Preface: I first...

Journal: :Pacific Journal of Mathematics 1959

Journal: :Journal of Approximation Theory 1994

2001
Jun Wang Klara Nahrstedt

With up-coming Quality of Service (QoS) requirements raised by a wide range of communication-intensive, real-time multimedia applications, resource reservation is one of the approaches to satisfy requested QoS. Resource ReSerVation Protocol (RSVP) is a well-known signaling protocol for bandwidth reservation in the Internet. However, the current reservation protocols like RSVP do not present the...

Journal: :IEEE Trans. Vehicular Technology 2001
Jin Weon Chang Dan Keun Sung

Soft handoff techniques in direct-sequence code-division multiple-access (DS-CDMA) systems provide mobile calls with seamless connections between adjacent cells. Channel reservation schemes are used to give high priority to more important soft handoff attempts over new call attempts. However, since the number of soft handoff attempts varies according to environmental conditions, fixed reservati...

2010
David L. Barrow DAVID L. BARROW

k Abstract. Let fip . . , Hk be odd positive integers and »i = Z¡=.x(p¡ + 1). Let {«(.}|=j be an extended Tchebycheff system on [a, b]. Let L be a positive linear functional on U = span( {u,}). We prove that L has a unique representation in the form k M,— 1 £<p) = E Z "i/PW(f,). « < h < ■ ■ • < tk < b, 1=1 ;=0 _ k for all p G U. The proof uses the topological degree of a mapping F: D C R k —► R...

2004
Hanhua Chen Hai Jin Feng Mao Hao Wu Yijiao Yu

Effective and efficient Quality of Service (QoS) management is critical for a service grid to meet the requirements of both grid users and service providers. We introduce a scalable framework of service management in grid environment to guarantee the QoS of grid services. Several characters of our framework are 1) grid level resource reservation mechanism to use existing heterogeneous resource ...

2003
Paulo Cesar S. Vidal Otto Carlos Muniz Bandeira Duarte

This paper presents a state aggregation mechanism of the RSVP protocol for multicast flows using IP-in-IP tunneling. The mechanism relies on periodic refresh messages between routers to maintain the reservation states (soft-state approach). Because of the loss of tunnel RSVP messages, the mechanism presents a very long latency at reservation establishment. The problem reduces the performance of...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید