1184 search results - page 141 / 237 » Memory Design for Constrained Dynamic Optimization Problems |
133
click to vote
CDC
2010
IEEE
14 years 9 months ago
2010
IEEE
ACT We consider the problem of sensor selection in resource constrained sensor networks. The fusion center selects a subset of k sensors from an available pool of m sensors accordi...
137
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
125
Voted
COMPGEOM
2003
ACM
15 years 7 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
111
click to vote
LCPC
2000
Springer
15 years 6 months ago
2000
Springer
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
154
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...