Sciweavers

1146 search results - page 94 / 230
» Finite cupping sets
Sort
View
COMBINATORICS
2000
88views more  COMBINATORICS 2000»
13 years 9 months ago
An Infinite Antichain of Permutations
We constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain. In other words, there exists an infini...
Daniel A. Spielman, Miklós Bóna
MOC
2000
77views more  MOC 2000»
13 years 8 months ago
Ultraconvergence of the patch recovery technique II
The ultraconvergence property of a gradient recovery technique proposed by Zienkiewicz and Zhu is analyzed for the Laplace equation in the two dimensional setting. Under the assump...
Zhimin Zhang
ORL
2008
115views more  ORL 2008»
13 years 8 months ago
On the convergence of stochastic dual dynamic programming and related methods
We discuss the almost-sure convergence of a broad class of sampling algorithms for multi-stage stochastic linear programs. We provide a convergence proof based on the finiteness o...
Andrew B. Philpott, Z. Guan
ISCIS
2009
Springer
14 years 3 months ago
Using a SAT solver to generate checking sequences
—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Y...
FOIKS
2008
Springer
13 years 10 months ago
Lossless Decompositions in Complex-Valued Databases
When decomposing database schemas, it is desirable that a decomposition is lossless and dependency preserving. A well-known and frequently used result for the relational model stat...
Henning Köhler, Sebastian Link