Sciweavers

265 search results - page 31 / 53
» Learning to Support Constraint Programmers
Sort
View
72
Voted
ICML
2008
IEEE
15 years 10 months ago
Memory bounded inference in topic models
What type of algorithms and statistical techniques support learning from very large datasets over long stretches of time? We address this question through a memory bounded version...
Ryan Gomes, Max Welling, Pietro Perona
ICWL
2007
Springer
15 years 3 months ago
A Web Application for Mathematics Education
AGILMAT is a web application designed to help students learn Mathematics, with focus on high-school algebra and calculus drills. A modular and extensible architecture and a wizard-...
Ana Paula Tomás, José Paulo Leal, Ma...
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
15 years 10 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
ML
2006
ACM
113views Machine Learning» more  ML 2006»
15 years 3 months ago
A separate compilation extension to standard ML
We present an extension to Standard ML, called SMLSC, to support separate compilation. The system gives meaning to individual program fragments, called units. Units may depend on ...
David Swasey, Tom Murphy VII, Karl Crary, Robert H...
ICFP
2010
ACM
14 years 10 months ago
Experience report: growing programming languages for beginning students
A student learning how to program learns best when the programming language and programming environment cater to her specific needs. These needs are different from the requirement...
Marcus Crestani, Michael Sperber