Sciweavers

380 search results - page 33 / 76
» Learning Recursive Control Programs from Problem Solving
Sort
View
JMLR
2010
149views more  JMLR 2010»
13 years 2 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
SIGCSE
1998
ACM
131views Education» more  SIGCSE 1998»
13 years 11 months ago
Animation, visualization, and interaction in CS 1 assignments
Programs that use animations or visualizations attract student interest and offer feedback that can enhance different learning styles as students work to master programming and pr...
Owen L. Astrachan, Susan H. Rodger
JMLR
2012
11 years 9 months ago
Multi Kernel Learning with Online-Batch Optimization
In recent years there has been a lot of interest in designing principled classification algorithms over multiple cues, based on the intuitive notion that using more features shou...
Francesco Orabona, Jie Luo, Barbara Caputo
JSA
2000
175views more  JSA 2000»
13 years 7 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd
PPDP
1999
Springer
13 years 11 months ago
Constraint Programming in OPL
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the rst modeling language to combine high-level algebraic and set notations f...
Pascal Van Hentenryck, Laurent Michel, Laurent Per...