Sciweavers

383 search results - page 37 / 77
» A new infeasible interior-point algorithm for linear program...
Sort
View
NIPS
2000
13 years 9 months ago
Active Support Vector Machine Classification
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...
Olvi L. Mangasarian, David R. Musicant
PLDI
2003
ACM
14 years 26 days ago
Taming the IXP network processor
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...
Lal George, Matthias Blume
ICDM
2007
IEEE
166views Data Mining» more  ICDM 2007»
14 years 1 months ago
Mining Statistical Information of Frequent Fault-Tolerant Patterns in Transactional Databases
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...
Ardian Kristanto Poernomo, Vivekanand Gopalkrishna...
ATAL
2007
Springer
14 years 1 months ago
Commitment-driven distributed joint policy search
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...
Stefan J. Witwicki, Edmund H. Durfee
CP
2009
Springer
14 years 8 months ago
Coalition Structure Generation Utilizing Compact Characteristic Function Representations
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...
Naoki Ohta, Vincent Conitzer, Ryo Ichimura, Yuko S...