Sciweavers

14161 search results - page 353 / 2833
» On generalized middle-level problem
Sort
View
CORR
2012
Springer
174views Education» more  CORR 2012»
14 years 2 months ago
Partial Searchlight Scheduling is Strongly PSPACE-complete
The problem of searching a polygonal region for an unpredictably moving intruder by a set of stationary guards, each carrying an orientable laser, is known as the Searchlight Sche...
Giovanni Viglietta
CORR
2012
Springer
225views Education» more  CORR 2012»
14 years 2 months ago
Compressive Principal Component Pursuit
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...
John Wright, Arvind Ganesh, Kerui Min, Yi Ma
INFOCOM
2010
IEEE
15 years 5 months ago
Markov Approximation for Combinatorial Network Optimization
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
Minghua Chen, Soung Chang Liew, Ziyu Shao, Caihong...
JETAI
2010
115views more  JETAI 2010»
15 years 5 months ago
From soft constraints to bipolar preferences: modelling framework and solving issues
Real-life problems present several kinds of preferences. We focus on problems with both positive and negative preferences, that we call bipolar preference problems. Although seemi...
Stefano Bistarelli, Maria Silvia Pini, Francesca R...
CORR
2010
Springer
178views Education» more  CORR 2010»
15 years 4 months ago
Adaptive Algorithms for Coverage Control and Space Partitioning in Mobile Robotic Networks
We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends ...
Jerome Le Ny, George J. Pappas