Sciweavers

19320 search results - page 253 / 3864
» On the complexity of computing determinants
Sort
View
ECAL
1999
Springer
15 years 11 months ago
Arithmetic Operations on Self-Replicating Cellular Automata
In this paper, we present a possible implementation of arithmetic functions (notably, addition and multiplication) using self-replicating cellular automata. The operations are per...
Enrico Petraglio, Jean-Marc Henry, Gianluca Tempes...
ECML
2006
Springer
15 years 10 months ago
Ensembles of Nearest Neighbor Forecasts
Nearest neighbor forecasting models are attractive with their simplicity and the ability to predict complex nonlinear behavior. They rely on the assumption that observations simila...
Dragomir Yankov, Dennis DeCoste, Eamonn J. Keogh
GECCO
2006
Springer
178views Optimization» more  GECCO 2006»
15 years 10 months ago
Adaptively choosing niching parameters in a PSO
Niching techniques play an important role in evolutionary algorithms. Existing niching methods often require userspecified parameters, limiting their usefulness. This paper propos...
Stefan Bird, Xiaodong Li
GLOBECOM
2009
IEEE
15 years 10 months ago
Localization Using Radial Basis Function Networks and Signal Strength Fingerprints in WLAN
Abstract—Fingerprinting localization techniques provide reliable location estimates and enable the development of location aware applications especially for indoor environments, ...
Christos Laoudias, Paul Kemppi, Christos G. Panayi...
COCO
2008
Springer
100views Algorithms» more  COCO 2008»
15 years 8 months ago
Detecting Rational Points on Hypersurfaces over Finite Fields
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
Swastik Kopparty, Sergey Yekhanin