Sciweavers

2035 search results - page 215 / 407
» Working memory
Sort
View
APNOMS
2006
Springer
15 years 10 months ago
Security Approaches for Cluster Interconnection in a Wireless Sensor Network
Abstract. A wireless sensor network is a collection of devices limited in lowpowered batteries, processing, communication bandwidth capabilities and low memory availability. Due to...
Alexandre Gava Menezes, Carlos Becker Westphall
DATE
2004
IEEE
144views Hardware» more  DATE 2004»
15 years 10 months ago
Cache-Aware Scratchpad Allocation Algorithm
In the context of portable embedded systems, reducing energy is one of the prime objectives. Most high-end embedded microprocessors include onchip instruction and data caches, alo...
Manish Verma, Lars Wehmeyer, Peter Marwedel
ACSC
2003
IEEE
15 years 10 months ago
Efficient Trie-Based Sorting of Large Sets of Strings
Sorting is a fundamental algorithmic task. Many generalpurpose sorting algorithms have been developed, but efficiency gains can be achieved by designing algorithms for specific ki...
Ranjan Sinha, Justin Zobel
EDBT
2000
ACM
15 years 10 months ago
Management and Query Processing of One-Dimensional Intervals with the UB-Tree
The management and query processing of one dimensional intervals is a special case of extended object handling. One dimensional intervals play an important role in temporal databa...
Robert Fenk
GECCO
2000
Springer
104views Optimization» more  GECCO 2000»
15 years 10 months ago
Quadratic Bloat in Genetic Programming
In earlier work we predicted program size would grow in the limit at a quadratic rate and up to fty generations we measured bloat O(generations1:2;1:5). On two simple benchmarks w...
William B. Langdon