196 search results - page 25 / 40 » A finite set of functions with an EXPTIME-complete compositi... |
114
click to vote
ICDM
2005
IEEE
15 years 5 months ago
2005
IEEE
The problem of record linkage focuses on determining whether two object descriptions refer to the same underlying entity. Addressing this problem effectively has many practical ap...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...
SIAMCO
2002
14 years 11 months ago
2002
Abstract. We formulate a robust optimal control problem for a general nonlinear system with finitely many admissible control settings and with costs assigned to switching of contro...
108
click to vote
JMLR
2006
14 years 11 months ago
2006
Support vector machines utilizing the 1-norm, typically set up as linear programs (Mangasarian, 2000; Bradley and Mangasarian, 1998), are formulated here as a completely unconstra...
EOR
2008
14 years 11 months ago
2008
The aim of this paper is to apply the concept of robust optimization introduced by Bel-Tal and Nemirovski to the portfolio selection problems based on multi-stage scenario trees. ...