Sciweavers

2725 search results - page 291 / 545
» Constraint Solving for Interpolation
Sort
View
AAAI
2006
15 years 8 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
SAC
2006
ACM
15 years 7 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
SIAMJO
2002
133views more  SIAMJO 2002»
15 years 7 months ago
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
Philip E. Gill, Walter Murray, Michael A. Saunders
WIOPT
2011
IEEE
14 years 11 months ago
Portfolio optimization in secondary spectrum markets
—In this paper, we address the spectrum portfolio optimization (SPO) question in the context of secondary spectrum markets, where bandwidth (spectrum access rights) can be bought...
Praveen Kumar Muthuswamy, Koushik Kar, Aparna Gupt...
CIKM
2011
Springer
14 years 7 months ago
Lower-bounding term frequency normalization
In this paper, we reveal a common deficiency of the current retrieval models: the component of term frequency (TF) normalization by document length is not lower-bounded properly;...
Yuanhua Lv, ChengXiang Zhai