Sciweavers

217 search results - page 2 / 44
» Quantifying group problem solving with stochastic analysis
Sort
View
CSCLP
2005
Springer
13 years 10 months ago
A Hybrid Benders' Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
Armagan Tarim, Ian Miguel
UM
2005
Springer
13 years 10 months ago
Modeling Individual and Collaborative Problem Solving in Medical Problem-Based Learning
Abstract. Since problem solving in group problem-based learning is a collaborative process, modeling individuals and the group is necessary if we wish to develop an intelligent tut...
Siriwan Suebnukarn, Peter Haddawy
SODA
2010
ACM
160views Algorithms» more  SODA 2010»
14 years 2 months ago
Solving Simple Stochastic Tail Games
Stochastic games are a natural model for open reactive processes: one player represents the controller and his opponent represents a hostile environment. The evolution of the syste...
Hugo Gimbert, Florian Horn
CORR
2008
Springer
128views Education» more  CORR 2008»
13 years 5 months ago
A Quantifier Elimination Algorithm for Linear Real Arithmetic
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutines satisfiability modulo this theory and polyhedral pro...
David Monniaux
ICONFERENCE
2011
12 years 12 months ago
The structure of collaborative problem solving in a virtual math team
To develop a science of small-group interaction in groupware, we need a method for analyzing the structure of computer-mediated discourse. Conversation analysis offers an analysis...
Gerry Stahl