Sciweavers

835 search results - page 146 / 167
» Finding Optimal Solutions to Cooperative Pathfinding Problem...
Sort
View
ICASSP
2008
IEEE
14 years 2 months ago
Sparse reconstruction by separable approximation
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
Stephen J. Wright, Robert D. Nowak, Mário A...
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
13 years 8 months ago
Agent-based support for interactive search in conceptual software engineering design
While recent attempts to search a conceptual software engineering design search space with multi-objective evolutionary algorithms have yielded promising results, the practical ap...
Christopher L. Simons, Ian C. Parmee
TIT
2008
141views more  TIT 2008»
13 years 7 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
IJDMBC
2010
115views more  IJDMBC 2010»
13 years 2 months ago
Near Optimum Power Control and Precoding under Fairness Constraints in Network MIMO Systems
Abstract--We consider the problem of setting the uplink signalto-noise-and-interference (SINR) target and allocating transmit powers for mobile stations in multicell spatial multip...
Gábor Fodor, Mikael Johansson, Pablo Soldat...
COMPGEOM
2007
ACM
13 years 11 months ago
Guard placement for efficient point-in-polygon proofs
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
David Eppstein, Michael T. Goodrich, Nodari Sitchi...