Sciweavers

110 search results - page 21 / 22
» Optimize Storage Placement in Sensor Networks
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 9 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
GECCO
2011
Springer
256views Optimization» more  GECCO 2011»
12 years 9 months ago
Evolving complete robots with CPPN-NEAT: the utility of recurrent connections
This paper extends prior work using Compositional Pattern Producing Networks (CPPNs) as a generative encoding for the purpose of simultaneously evolving robot morphology and contr...
Joshua E. Auerbach, Josh C. Bongard
IPSN
2005
Springer
13 years 11 months ago
Design considerations for solar energy harvesting wireless embedded systems
Abstract— Sustainable operation of battery powered wireless embedded systems (such as sensor nodes) is a key challenge, and considerable research effort has been devoted to energ...
Vijay Raghunathan, Aman Kansal, Jason Hsu, Jonatha...
CCE
2006
13 years 5 months ago
An efficient algorithm for large scale stochastic nonlinear programming problems
The class of stochastic nonlinear programming (SNLP) problems is important in optimization due to the presence of nonlinearity and uncertainty in many applications, including thos...
Y. Shastri, Urmila M. Diwekar
CASES
2006
ACM
13 years 11 months ago
Automated compile-time and run-time techniques to increase usable memory in MMU-less embedded systems
Random access memory (RAM) is tightly-constrained in many embedded systems. This is especially true for the least expensive, lowest-power embedded systems, such as sensor network ...
Lan S. Bai, Lei Yang, Robert P. Dick