Sciweavers

975 search results - page 53 / 195
» Locality Optimization for Program Instances
Sort
View
CP
2008
Springer
14 years 11 months ago
Optimization of Simple Tabular Reduction for Table Constraints
Abstract. Table constraints play an important role within constraint programming. Recently, many schemes or algorithms have been proposed to propagate table constraints or/and to c...
Christophe Lecoutre
CP
2003
Springer
15 years 3 months ago
Terminating Decision Algorithms Optimally
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
Tuomas Sandholm
CN
2008
106views more  CN 2008»
14 years 8 months ago
Optimization models and methods for planning wireless mesh networks
In this paper novel optimization models are proposed for planning Wireless Mesh Networks (WMNs), where the objective is to minimize the network installation cost while providing f...
Edoardo Amaldi, Antonio Capone, Matteo Cesana, Ila...
SIAMJO
2008
92views more  SIAMJO 2008»
14 years 9 months ago
An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
For a mathematical program with complementarity constraints (MPCC), we propose an active-set Newton method, which has the property of local quadratic convergence under the MPCC lin...
Alexey F. Izmailov, Mikhail V. Solodov
82
Voted
ICASSP
2008
IEEE
15 years 4 months ago
Contextually adaptive signal representation using conditional principal component analysis
The conventional method of generating a basis that is optimally adapted (in MSE) for representation of an ensemble of signals is Principal Component Analysis (PCA). A more ambitio...
Rosa M. Figueras i Ventura, Umesh Rajashekar, Zhou...