Sciweavers

4335 search results - page 65 / 867
» Privatizing Constraint Optimization
Sort
View
JMLR
2010
119views more  JMLR 2010»
13 years 3 months ago
Factorized Orthogonal Latent Spaces
Existing approaches to multi-view learning are particularly effective when the views are either independent (i.e, multi-kernel approaches) or fully dependent (i.e., shared latent ...
Mathieu Salzmann, Carl Henrik Ek, Raquel Urtasun, ...
CP
2007
Springer
14 years 3 months ago
Dealing with Incomplete Preferences in Soft Constraint Problems
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, situations with several agents providing the data, or with possibl...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
ANOR
2007
91views more  ANOR 2007»
13 years 9 months ago
An overview of bilevel optimization
Abstract This paper is devoted to bilevel optimization, a branch of mathematical programming of both practical and theoretical interest. Starting with a simple example, we proceed ...
Benoît Colson, Patrice Marcotte, Gilles Sava...
CORR
2000
Springer
89views Education» more  CORR 2000»
13 years 8 months ago
Approximation and Exactness in Finite State Optimality Theory
Previous work (Frank and Satta, 1998; Karttunen, 1998) has shown that Optimality Theory with gradient constraints generally is not finite state. A new finite-state treatment of gr...
Dale Gerdemann, Gertjan van Noord
WLP
2004
Springer
14 years 2 months ago
Effective Modeling with Constraints
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
Roman Barták