The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
We analyze the antecedents of affective states in a simulation problem-solving environment, The Incredible Machine: Even More Contraptions, through quantitative field observations ...
Ryan Shaun Joazeiro de Baker, Ma. Mercedes T. Rodr...
We investigate the relationship between a student’s affect and how he or she chooses to use a simulation problem-solving environment, using quantitative field observations. Withi...
Ma. Mercedes T. Rodrigo, Ryan Shaun Joazeiro de Ba...
A negotiation chain is formed when multiple related negotiations are spread over multiple agents. In order to appropriately order and structure the negotiations occurring in the c...