نتایج جستجو برای: space is known unfortunately
تعداد نتایج: 7481561 فیلتر نتایج به سال:
Finding the closest point in a high-dimensional space is a problem that often occurs in pattern recognition. Unfortunately, the complexity of most known search algorithms grows exponentially with dimension, which makes them unsuitable for high dimensions. However, for most applications, the closest point is of interest only if it is closer than some pre-defined distance. In the article ”A Simpl...
Endurance Time method is a time history dynamic analysis in which structures are subjected to increasing excitations. These excitations are known as endurance time excitation functions (ETEF). This study proposes a new method for generating ETEFs. In the proposed method, a new basis function for representing ETEFs is introduced. This type of ETEFs representation creates an intelligent space for...
We address the problem of model checking hybrid systems which exhibit nontrivial discrete behavior and thus cannot be treated by considering the discrete states one by one, as most currently available verification tools do. Our procedure relies on a deep integration of several techniques and tools. An extension of AND-Inverter-Graphs (AIGs) with first-order constraints serves as a compact repre...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید