Sciweavers

79 search results - page 1 / 16
» Searching for extensible Korobov rules
Sort
View
72
Voted
JC
2007
65views more  JC 2007»
15 years 28 days 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
93
Voted
COMPUTING
2007
118views more  COMPUTING 2007»
15 years 1 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. ...
105
Voted
TIME
2005
IEEE
15 years 6 months ago
Search Strategies for Resolution in CTL-Type Logics: Extension and Complexity
A clausal resolution approach originally developed for the branching logic CTL has recently been extended to the logics ECTL and ECTL+ . In the application of the resolution rules...
Artie Basukoski, Alexander Bolotov
106
Voted
CIKM
1999
Springer
15 years 5 months ago
Rule-Based Query Optimization, Revisited
We present the architecture and a performance assessment of an extensible query optimizer written in Venus. Venus is a general-purpose active-database rule language embedded in C+...
Lane Warshaw, Daniel P. Miranker
132
Voted
CP
2011
Springer
14 years 26 days ago
Pruning Rules for Constrained Optimisation for Conditional Preferences
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
Nic Wilson, Walid Trabelsi