Sciweavers

2861 search results - page 276 / 573
» Constraint Programming
Sort
View
MP
2007
76views more  MP 2007»
15 years 6 months ago
Universal duality in conic convex optimization
Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both...
Simon P. Schurr, André L. Tits, Dianne P. O...
PPDP
2009
Springer
16 years 1 months ago
A declarative encoding of telecommunications feature subscription in SAT
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
Michael Codish, Samir Genaim, Peter J. Stuckey
EMSOFT
2009
Springer
16 years 1 months ago
Clock-driven distributed real-time implementation of endochronous synchronous programs
An important step in model-based embedded system design consists in mapping functional specifications and their tasks/operations onto execution architectures and their ressources...
Dumitru Potop-Butucaru, Robert de Simone, Yves Sor...
IPPS
2006
IEEE
16 years 17 days ago
Memory minimization for tensor contractions using integer linear programming
This paper presents a technique for memory optimization for a class of computations that arises in the field of correlated electronic structure methods such as coupled cluster and...
A. Allam, J. Ramanujam, Gerald Baumgartner, P. Sad...
ISNN
2005
Springer
16 years 1 days ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu