1204 search results - page 70 / 241 » Termination of Polynomial Programs |
103
Voted
COCOA
2007
Springer
15 years 6 months ago
2007
Springer
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...
88
Voted
ICCD
2003
IEEE
15 years 9 months ago
2003
IEEE
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
84
Voted
MMM
2006
Springer
15 years 6 months ago
2006
Springer
This paper presents a SVM-based prediction approach for constructing personal recommendation system for TV programs. We have applied Support Vector Machine (SVM) to personal predi...
105
Voted
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
— Multi-slot resource scheduling in a general two dimensional wireless ad hoc network, is a hard problem with no known polynomial-time solution. Recent optimization theoretic ana...
SAC
2010
ACM
15 years 7 months ago
2010
ACM
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...