Sciweavers

3415 search results - page 440 / 683
» Lower bounds on kernelization
Sort
View
MOC
2000
96views more  MOC 2000»
15 years 6 months ago
Galerkin eigenvector approximations
How close are Galerkin eigenvectors to the best approximation available out of the trial subspace? Under a variety of conditions the Galerkin method gives an approximate eigenvecto...
Christopher Beattie
MOC
2000
76views more  MOC 2000»
15 years 6 months ago
Optimal approximation of stochastic differential equations by adaptive step-size control
We study the pathwise (strong) approximation of scalar stochastic differential equations with respect to the global error in the L2-norm. For equations with additive noise we estab...
Norbert Hofmann, Thomas Müller-Gronbach, Klau...
MOC
2000
88views more  MOC 2000»
15 years 6 months ago
A posteriori error estimation for variational problems with uniformly convex functionals
The objective of this paper is to introduce a general scheme for deriving a posteriori error estimates by using duality theory of the calculus of variations. We consider variationa...
Sergey I. Repin
EOR
2002
105views more  EOR 2002»
15 years 6 months ago
Two-dimensional packing problems: A survey
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...
Andrea Lodi, Silvano Martello, Michele Monaci
APIN
1998
78views more  APIN 1998»
15 years 6 months ago
The Method of Assigning Incidences
Incidence calculus is a probabilistic logic in which incidences, standing for the situations in which formulae may be true, are assigned to some formulae, and probabilities are as...
Weiru Liu, David McBryan, Alan Bundy