Sciweavers

3946 search results - page 615 / 790
» The computational complexity of choice sets
Sort
View
GECCO
2007
Springer
213views Optimization» more  GECCO 2007»
16 years 22 days ago
Genetically programmed learning classifier system description and results
An agent population can be evolved in a complex environment to perform various tasks and optimize its job performance using Learning Classifier System (LCS) technology. Due to the...
Gregory Anthony Harrison, Eric W. Worden
ESAS
2004
Springer
15 years 12 months ago
Public Key Cryptography in Sensor Networks - Revisited
The common perception of public key cryptography is that it is complex, slow and power hungry, and as such not at all suitable for use in ultra-low power environments like wireless...
Gunnar Gaubatz, Jens-Peter Kaps, Berk Sunar
CDC
2009
IEEE
185views Control Systems» more  CDC 2009»
15 years 11 months ago
Discrete Empirical Interpolation for nonlinear model reduction
A dimension reduction method called Discrete Empirical Interpolation (DEIM) is proposed and shown to dramatically reduce the computational complexity of the popular Proper Orthogo...
Saifon Chaturantabut, Danny C. Sorensen
EMNETS
2007
15 years 10 months ago
Robust node localization for wireless sensor networks
The node localization problem in Wireless Sensor Networks has received considerable attention, driven by the need to obtain a higher location accuracy without incurring a large, p...
Radu Stoleru, John A. Stankovic, Sang Hyuk Son
BIOADIT
2006
Springer
15 years 10 months ago
Robot Control: From Silicon Circuitry to Cells
Life-like adaptive behaviour is so far an illusive goal in robot control. A capability to act successfully in a complex, ambiguous, and harsh environment would vastly increase the ...
Soichiro Tsuda, Klaus-Peter Zauner, Yukio-Pegio Gu...