Sciweavers

1974 search results - page 82 / 395
» On Unbiased Linear Approximations
Sort
View
TEC
2008
115views more  TEC 2008»
15 years 17 days ago
Function Approximation With XCS: Hyperellipsoidal Conditions, Recursive Least Squares, and Compaction
An important strength of learning classifier systems (LCSs) lies in the combination of genetic optimization techniques with gradient-based approximation techniques. The chosen app...
Martin V. Butz, Pier Luca Lanzi, Stewart W. Wilson
VLSID
2007
IEEE
94views VLSI» more  VLSID 2007»
16 years 1 months ago
A Reduced Complexity Algorithm for Minimizing N-Detect Tests
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
Kalyana R. Kantipudi, Vishwani D. Agrawal
115
Voted
ENTCS
2006
118views more  ENTCS 2006»
15 years 20 days ago
Domain Theoretic Solutions of Initial Value Problems for Unbounded Vector Fields
This paper extends the domain theoretic method for solving initial value problems, described in [8], to unbounded vector fields. Based on a sequence of approximations of the vecto...
Abbas Edalat, Dirk Pattinson
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
15 years 10 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
69
Voted
EUSFLAT
2003
206views Fuzzy Logic» more  EUSFLAT 2003»
15 years 2 months ago
Analysis of multi-product break-even with uncertain information
We revise the classic methodology to find the multi-product break-even point. In the current paper we propose a solution to the problem under uncertainty conditions, based on DurÃ...
Luisa L. Lazzari, María Silvia Moriñ...