Sciweavers

6315 search results - page 339 / 1263
» Approximating Solution Structure
Sort
View
DAM
1999
132views more  DAM 1999»
15 years 6 months ago
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
Giovanni Righini, Marco Trubian
MOC
1998
147views more  MOC 1998»
15 years 6 months ago
On the Diophantine equation |axn - byn | = 1
If a, b and n are positive integers with b ≥ a and n ≥ 3, then the equation of the title possesses at most one solution in positive integers x and y, with the possible exceptio...
Michael A. Bennett, Benjamin M. M. de Weger
SIAMCOMP
1998
124views more  SIAMCOMP 1998»
15 years 6 months ago
Near-Linear Time Construction of Sparse Neighborhood Covers
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
Baruch Awerbuch, Bonnie Berger, Lenore Cowen, Davi...
NA
2007
62views more  NA 2007»
15 years 6 months ago
Runge-Kutta interpolants for high precision computations
Runge-Kutta (RK) pairs furnish approximations of the solution of an initial value problem at discrete points in the interval of integration. Many techniques for enriching these met...
Ch. Tsitouras
TSP
2008
129views more  TSP 2008»
15 years 5 months ago
A Basic Convergence Result for Particle Filtering
The basic nonlinear filtering problem for dynamical systems is considered. Approximating the optimal filter estimate by particle filter methods has become perhaps the most common a...
Xiao-Li Hu, Thomas B. Schön, Lennart Ljung