Sciweavers

1557 search results - page 33 / 312
» Programming up to Congruence
Sort
View
95
Voted
HIPEAC
2005
Springer
15 years 4 months ago
A Practical Method for Quickly Evaluating Program Optimizations
This article aims at making iterative optimization practical and usable by speeding up the evaluation of a large range of optimizations. Instead of using a full run to evaluate a s...
Grigori Fursin, Albert Cohen, Michael F. P. O'Boyl...
107
Voted
ANNPR
2006
Springer
15 years 2 months ago
Fast Training of Linear Programming Support Vector Machines Using Decomposition Techniques
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...
Yusuke Torii, Shigeo Abe
79
Voted
ICCAD
1995
IEEE
110views Hardware» more  ICCAD 1995»
15 years 2 months ago
Fast functional simulation using branching programs
This paper addresses the problem of speeding up functional (delayindependent)logic simulation for synchronousdigital systems. The problem needs very little new motivation – cycl...
Pranav Ashar, Sharad Malik
93
Voted
IJAIT
2008
99views more  IJAIT 2008»
14 years 11 months ago
Optimal Basic Block Instruction Scheduling for Multiple-Issue Processors Using Constraint Programming
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction sch...
Abid M. Malik, Jim McInnes, Peter van Beek
80
Voted
SIAMJO
2010
97views more  SIAMJO 2010»
14 years 5 months ago
A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
Abstract. We consider a Newton-CG augmented Lagrangian method for solving semidefinite programming (SDP) problems from the perspective of approximate semismooth Newton methods. In ...
Xin-Yuan Zhao, Defeng Sun, Kim-Chuan Toh