Sciweavers

7 search results - page 1 / 2
» The construction of good extensible Korobov rules
Sort
View
COMPUTING
2007
118views more  COMPUTING 2007»
13 years 5 months ago
The construction of good extensible Korobov rules
In this paper we introduce construction algorithms for Korobov rules for numerical integration which work well for a given set of dimensions simultaneously. The existence of such ...
Josef Dick, Friedrich Pillichshammer, Benjamin J. ...
MOC
2002
80views more  MOC 2002»
13 years 4 months ago
Component-by-component construction of good lattice rules
This paper provides a novel approach to the construction of good lattice rules for the integration of Korobov classes of periodic functions over the unit s-dimensional cube. Theore...
Ian H. Sloan, Andrew V. Reztsov
JC
2007
65views more  JC 2007»
13 years 5 months ago
Searching for extensible Korobov rules
Extensible lattice sequences have been proposed and studied in [5–7]. For the special case of extensible Korobov sequences, parameters can be found in [6]. The searches made to ...
Hardeep S. Gill, Christiane Lemieux
WABI
2009
Springer
127views Bioinformatics» more  WABI 2009»
13 years 12 months ago
Constructing Majority-Rule Supertrees
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...
Jianrong Dong, David Fernández-Baca, Fred R...
CORR
2010
Springer
150views Education» more  CORR 2010»
13 years 5 months ago
Extraction of Symbolic Rules from Artificial Neural Networks
Although backpropagation ANNs generally predict better than decision trees do for pattern classification problems, they are often regarded as black boxes, i.e., their predictions c...
S. M. Kamruzzaman, Md. Monirul Islam