Sciweavers

2899 search results - page 543 / 580
» Engineering Optimization Using a Simple Evolutionary Algorit...
Sort
View
CASES
2003
ACM
15 years 7 months ago
Compiler-decided dynamic memory allocation for scratch-pad based embedded systems
This paper presents a highly predictable, low overhead and yet dynamic, memory allocation strategy for embedded systems with scratch-pad memory. A scratch-pad is a fast compiler-m...
Sumesh Udayakumaran, Rajeev Barua
TIT
2008
141views more  TIT 2008»
15 years 2 months ago
Dimensionality Reduction for Distributed Estimation in the Infinite Dimensional Regime
Distributed estimation of an unknown signal is a common task in sensor networks. The scenario usually envisioned consists of several nodes, each making an observation correlated wi...
Olivier Roy, Martin Vetterli
DAC
2004
ACM
16 years 3 months ago
Dynamic FPGA routing for just-in-time FPGA compilation
Just-in-time (JIT) compilation has previously been used in many applications to enable standard software binaries to execute on different underlying processor architectures. Howev...
Roman L. Lysecky, Frank Vahid, Sheldon X.-D. Tan
BMCBI
2011
14 years 5 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
ATAL
2007
Springer
15 years 8 months ago
Multiagent learning in adaptive dynamic systems
Classically, an approach to the multiagent policy learning supposed that the agents, via interactions and/or by using preliminary knowledge about the reward functions of all playe...
Andriy Burkov, Brahim Chaib-draa