Sciweavers

221 search results - page 29 / 45
» Duality in Optimization and Constraint Satisfaction
Sort
View
CP
2008
Springer
13 years 9 months ago
Solving a Telecommunications Feature Subscription Configuration Problem
Abstract. Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a fea...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
SIAMSC
2008
139views more  SIAMSC 2008»
13 years 7 months ago
Probing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
Ewout van den Berg, Michael P. Friedlander
IAT
2008
IEEE
14 years 1 months ago
Competency-Based Intelligent Curriculum Sequencing: Comparing Two Evolutionary Approaches
The process of creating e-learning contents using reusable learning objects (LOs) can be broken down in two sub-processes: LOs finding and LO sequencing. Although semiautomatic to...
Luis de Marcos, Roberto Barchino, José-Javi...
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
14 years 8 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
13 years 7 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang