Sciweavers

4103 search results - page 209 / 821
» Some results on the Collatz problem
Sort
View
COGSCI
2004
74views more  COGSCI 2004»
15 years 6 months ago
You'll see what you mean: Students encode equations based on their knowledge of arithmetic
This study investigated the roles of problem structure and strategy use in problem encoding. Fourthgrade students solved and explained a set of typical addition problems (e.g., 5 ...
Nicole M. McNeil, Martha W. Alibali
NEUROSCIENCE
2001
Springer
15 years 11 months ago
Analysis and Synthesis of Agents That Learn from Distributed Dynamic Data Sources
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
Doina Caragea, Adrian Silvescu, Vasant Honavar
ESA
2006
Springer
102views Algorithms» more  ESA 2006»
15 years 10 months ago
Necklaces, Convolutions, and X + Y
We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here ali...
David Bremner, Timothy M. Chan, Erik D. Demaine, J...
IPCO
2007
126views Optimization» more  IPCO 2007»
15 years 8 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...
RSS
2007
105views Robotics» more  RSS 2007»
15 years 8 months ago
Motion Strategies for Surveillance
Abstract— We address the problem of surveillance in an environment with obstacles. We show that the problem of tracking an evader with one pursuer around one corner is completely...
Sourabh Bhattacharya, Salvatore Candido, Seth Hutc...