320 search results - page 15 / 64 » Exploiting Nonlinear Dynamics to Store and Process Informati... |
AMCS
2010
14 years 12 months ago
2010
satisfactory network connectivity have dominated this line of research and abstracted away from the mathematical description of the physical processes underlying the observed pheno...
67
Voted
FPL
2008
Springer
15 years 1 months ago
2008
Springer
In multi-context Dynamically Reconfigurable Processor Array (DRPA), the required number of contexts is often increased by those with low resource usage. In order to execute such c...
ICNP
2005
IEEE
15 years 5 months ago
2005
IEEE
Existing geographic routing algorithms depend on the planarization of the network connectivity graph for correctness, and the planarization process gives rise to a welldefined no...
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
15 years 1 months ago
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
113
click to vote
TSP
2010
14 years 6 months ago
2010
The problem of distributed average consensus with quantized data is considered in this correspondence. Conventional consensus algorithms suffer from divergence when quantization er...