The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Abstract The basic idea of our new approach is to determine in a first step for each node those pairs of nodes which allow a good interpolation of the unknowns located at this node. These pairs of neighbor nodes (in some cases only one node) are called parent nodes. This is done by solving a local minimization problem which, in addition, yields the interpolation and restriction coefficients. The construction...
Abstract The minimum common supergraph of two graphs, g1 and g2, is defined as the smallest graph that includes, as subgraphs, both g1 and g2. It is shown that minimum common supergraph computation can be solved by means of maximum common subgraph computation. For the latter problem, algorithms are known from the literature. It will also be shown that for a certain class of cost functions, the concept...
Abstract The paper deals with the local Cauchy problem for nonlinear functional differential systems. We investigate a general class of difference methods for this problem. We construct interpolating operators on the Haar pyramid and we give an error estimate for approximate solutions. We adopt nonlinear estimates of the Perron type for given functions with respect to the functional variable. The...
Abstract To solve the elliptic boundary value problems with singularities, the simplified hybrid combinations of the Ritz-Galerkin and finite element methods (RGM-FEM) are explored to lead to the global superconvergence rates on the entire solution domain, based on an a posteriori interpolation techniques of Lin and Yan [12] that only cost a little more computation. Let the solution domain S=S1S20...
Abstract In this paper, we consider the problem of on-line uniform machine scheduling with rejection. For the two machine case and a special three machine case, we present the best possible on-line algorithms for certain values of speed ratio s.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.