383 search results - page 37 / 77 » A new infeasible interior-point algorithm for linear program... |
137
Voted
NIPS
2000
15 years 5 months ago
2000
An active set strategy is applied to the dual of a simple reformulation of the standard quadratic program of a linear support vector machine. This application generates a fast new...
128
Voted
PLDI
2003
ACM
15 years 9 months ago
2003
ACM
We compile Nova, a new language designed for writing network processing applications, using a back end based on integer-linear programming (ILP) for register allocation, optimal b...
120
Voted
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
Constraints applied on classic frequent patterns are too strict and may cause interesting patterns to be missed. Hence, researchers have proposed to mine a more relaxed version of...
153
Voted
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
252
click to vote
CP
2009
Springer
16 years 4 months ago
2009
Springer
This paper presents a new way of formalizing the Coalition Structure Generation problem (CSG), so that we can apply constraint optimization techniques to it. Forming effective coal...