2864 search results - page 259 / 573 » Constraint Programming in OPL |
174
click to vote
ANNPR
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decom...
143
click to vote
IJCAI
2001
15 years 6 months ago
2001
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
131
click to vote
EOR
2007
15 years 5 months ago
2007
One of the key challenges of current day electronic procurement systems is to enable procurement decisions transcend beyond a single attribute such as cost. Consequently, multiatt...
120
click to vote
SIAMJO
2008
15 years 5 months ago
2008
We give some new regularity conditions for Fenchel duality in separated locally convex vector spaces, written in terms of the notion of quasi interior and quasi-relative interior, ...
149
click to vote
TCBB
2008
15 years 5 months ago
2008
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...