Sciweavers

5331 search results - page 418 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
AI
2006
Springer
15 years 6 months ago
Constraint-based optimization and utility elicitation using the minimax decision criterion
In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which multiple users have distinct preferences. However, making su...
Craig Boutilier, Relu Patrascu, Pascal Poupart, Da...
DM
2006
128views more  DM 2006»
15 years 6 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
JCNS
2010
103views more  JCNS 2010»
15 years 1 months ago
Efficient computation of the maximum a posteriori path and parameter estimation in integrate-and-fire and more general state-spa
A number of important data analysis problems in neuroscience can be solved using state-space models. In this article, we describe fast methods for computing the exact maximum a pos...
Shinsuke Koyama, Liam Paninski
FMCAD
2007
Springer
16 years 1 months ago
Fast Minimum-Register Retiming via Binary Maximum-Flow
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton
SDM
2010
SIAM
151views Data Mining» more  SDM 2010»
15 years 8 months ago
Fast Stochastic Frank-Wolfe Algorithms for Nonlinear SVMs
The high computational cost of nonlinear support vector machines has limited their usability for large-scale problems. We propose two novel stochastic algorithms to tackle this pr...
Hua Ouyang, Alexander Gray