Sciweavers

606 search results - page 2 / 122
» Novel algorithm explanation techniques for improving algorit...
Sort
View
ISPD
2012
ACM
289views Hardware» more  ISPD 2012»
12 years 1 months ago
Keep it straight: teaching placement how to better handle designs with datapaths
As technology scales and frequency increases, a new design style is emerging, referred to as hybrid designs, which contain a mixture of random logic and datapath standard cell com...
Samuel I. Ward, Myung-Chul Kim, Natarajan Viswanat...
CCE
2004
13 years 5 months ago
Improving convergence of the stochastic decomposition algorithm by using an efficient sampling technique
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
José María Ponce-Ortega, Vicente Ric...
JAIR
2000
94views more  JAIR 2000»
13 years 5 months ago
Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
Subbarao Kambhampati
SIGCSE
1997
ACM
112views Education» more  SIGCSE 1997»
13 years 9 months ago
Introducing fixed-point iteration early in a compiler course
When teaching a course in compiler design, it is conventional to introduce the iterative calculation of least fixed points quite late in the course, in the guise of iterative dat...
Max Hailperin
ICML
2005
IEEE
14 years 6 months ago
Explanation-Augmented SVM: an approach to incorporating domain knowledge into SVM learning
We introduce a novel approach to incorporating domain knowledge into Support Vector Machines to improve their example efficiency. Domain knowledge is used in an Explanation Based ...
Qiang Sun, Gerald DeJong