Sciweavers

491 search results - page 21 / 99
» Linear Quantifier Elimination
Sort
View
WSC
2004
13 years 9 months ago
Teaching Regression with Simulation
Computer simulations can be used to teach complicated statistical concepts in linear regression more quickly and effectively than traditional lecture alone. In introductory applie...
John H. Walker
ISORC
2003
IEEE
14 years 24 days ago
Metrics and Models for Cost and Quality of Component-Based Software
Quality and risk concerns currently limit the application of commercial off-the-shelf (COTS) software components to non-critical applications. Software metrics can quantify factor...
Sahra Sedigh-Ali, Arif Ghafoor, Raymond A. Paul
AISC
2006
Springer
13 years 11 months ago
An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together w...
Songxin Liang, David J. Jeffrey
APAL
2000
90views more  APAL 2000»
13 years 7 months ago
The definable multiplicity property and generic automorphisms
Let T be a strongly minimal theory with quantifier elimination. We show that the class of existentially closed models of T {" is an automorphism"} is an elementary clas...
Hirotaka Kikyo, Anand Pillay
TACAS
2009
Springer
144views Algorithms» more  TACAS 2009»
14 years 2 days ago
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
Christoph Scholl, Stefan Disch, Florian Pigorsch, ...