Sciweavers

1930 search results - page 121 / 386
» Epistemic comparative conditionals
Sort
View
JDWM
2007
122views more  JDWM 2007»
15 years 6 months ago
A Hyper-Heuristic for Descriptive Rule Induction
Rule induction from examples is a machine learning technique that finds rules of the form condition → class, where condition and class are logic expressions of the form variable...
Tho Hoan Pham, Tu Bao Ho
JUCS
2007
88views more  JUCS 2007»
15 years 6 months ago
A Comparison of Various Methods for Computing Bounds for Positive Roots of Polynomials
Abstract: The recent interest in isolating real roots of polynomials has revived interest in computing sharp upper bounds on the values of the positive roots of polynomials. Until ...
Alkiviadis G. Akritas, Panagiotis S. Vigklas
LOGCOM
2007
97views more  LOGCOM 2007»
15 years 6 months ago
A General Framework for Expressing Preferences in Causal Reasoning and Planning
We consider the problem of incorporating arbitrary preferences in planning systems. A preference may be seen as a goal or constraint that is desirable, but not necessary, to satis...
James P. Delgrande, Torsten Schaub, Hans Tompits
MOC
2002
115views more  MOC 2002»
15 years 6 months ago
Approximation by quadrilateral finite elements
We consider the approximation properties of finite element spaces on quadrilateral meshes. The finite element spaces are constructed starting with a given finite dimensional space ...
Douglas N. Arnold, Daniele Boffi, Richard S. Falk
TCAD
1998
115views more  TCAD 1998»
15 years 6 months ago
Probabilistic modeling of dependencies during switching activity analysis
—This paper addresses, from a probabilistic point of view, the issue of switching activity estimation in combinational circuits under the zero-delay model. As the main theoretica...
Radu Marculescu, Diana Marculescu, Massoud Pedram