نتایج جستجو برای: like problem

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

2005
Yoshinao Sato

D0-branes on a D2-brane with a constant background B-field are unstable due to the presence of a tachyonic mode and expected to dissolve into the D2-brane to formulate a constant D0-charge density. In this paper we study such a dissolution process in terms of a noncommutative gauge theory. Our results show that the localized D0-brane spreads out over all of space on the D2-brane as the tachyon ...

Journal: :CoRR 2017
Guy Louchard

The classical secretary problem has been generalized over the years into several directions. In this paper we confine our interest to those generalizations which have to do with the more general problem of stopping on a last observation of a specific kind. We follow Dendievel [10], [11], (where a bibliography can be found) who studies several types of such problems, mainly initiated by Bruss [3...

2006
Rolf Harren

Given a list of d-dimensional cuboid items with associated profits, the orthogonal knapsack problem asks for a packing of a selection with maximal profit into the unit cube. We restrict the items to hypercube shapes and derive a ( 5 4 + )-approximation for the twodimensional case. In a second step we generalize our result to a ( 2 +1 2d + )approximation for d-dimensional packing.

2010
Satoshi Sato Sayoko Kaide

This paper proposes a simple and fast person-name filter, which plays an important role in automatic compilation of a large bilingual person-name lexicon. This filter is based on pn score, which is the sum of two component scores, the score of the first name and that of the last name. Each score is calculated from two term sets: one is a dense set in which most of the members are person names; ...

1980
E. MENDELSOHN

We prove that a partial Steiner triple system 8 of order n can be embedded in a Steiner triple system T of any given admissible order greater than 4w. Furthermore, if G(S), the missing-edge graph of S, has the property that A(G)<ri(n + l)l and \E(G)\ then # can be embedded in a Steiner triple system of order 2n +1, provided that 2w +1 is admissible. We also prove that if there is a partial Stei...

Journal: :Computer Networks and ISDN Systems 1995
Fabrice Guillemin Charles Levert Catherine Rosenberg

In this paper, we investigate how the concept of cell conformance testing developed within the CCITT could apply for connections with two types of tra c (namely with both CLP=0 and CLP=1 cells) in the Tra c Contract recommended by the CCITT (i.e., declaration of the peak cell rates of the CLP=0 and the aggregate CLP=0+1 cell streams). This issue is crucial in the sense that this Tra c Contract ...

2009
Joël Ouaknine Alexander Moshe Rabinovich James Worrell

We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bounded language inclusion for timed automata is 2EXPSPACE-Complete. We also investigate the satisfiability and model-checking problems for Metric Temporal Logic (MTL), as well as monadic firstand second-order logics over the rea...

In this paper, we introduce and study fuzzy variational-like inclusion, fuzzy resolvent equation and $H(cdot,cdot)$-$phi$-$eta$-accretive operator in real  uniformly smooth Banach spaces. It is established that fuzzy variational-like inclusion is equivalent to a fixed point problem as well as to a fuzzy resolvent equation. This equivalence is used to define an iterative algorithm for solving fu...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شهید باهنر کرمان - دانشکده ریاضی و کامپیوتر 1390

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

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

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