Sciweavers

3602 search results - page 10 / 721
» Isn't It About Time
Sort
View
CG
2008
Springer
13 years 9 months ago
About the Completeness of Depth-First Proof-Number Search
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
Akihiro Kishimoto, Martin Müller 0003
CORR
2008
Springer
63views Education» more  CORR 2008»
13 years 7 months ago
Testing Statistical Hypotheses About Ergodic Processes
We propose a method for statistical analysis of time series, that allows us to obtain solutions to some classical problems of mathematical statistics under the only assumption tha...
Daniil Ryabko, Boris Ryabko
AIED
2005
Springer
14 years 1 months ago
Teaching about Dynamic Processes A Teachable Agents Approach
This paper discusses the extensions that we have made to Betty’s Brain teachable agent system to help students learn about dynamic processes in a river ecosystem. Students first ...
Ruchi Gupta, Yanna Wu, Gautam Biswas
IROS
2006
IEEE
87views Robotics» more  IROS 2006»
14 years 1 months ago
Unraveling of Deformable Linear Objects Based on 2D Information about Their Crossing States
— A planning method for unraveling deformable linear objects based on 2D information about their crossing states is proposed. In manipulation of a linear object, its raveling mus...
Hidefumi Wakamatsu, Akira Tsumaya, Eiji Arai, Shin...
LOGCOM
2008
120views more  LOGCOM 2008»
13 years 7 months ago
Reconstructing an Agent's Epistemic State from Observations about its Beliefs and Non-beliefs
We look at the problem in belief revision of trying to make inferences about what an agent believed--or will believe--at a given moment, based on an observation of how the agent h...
Richard Booth, Alexander Nittka