13306 search results - page 2237 / 2662 » Theoretical Computer Science |
180
click to vote
AIED
2005
Springer
16 years 1 months ago
2005
Springer
Part of the motivation behind the evolution of learning environments is the idea of providing students with individualized instructional strategies that allow them to learn as much...
190
click to vote
ATVA
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
149
click to vote
CIARP
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. This paper presents a new approach to the question of surface grading based on soft colour-texture descriptors and well known classifiers. These descriptors come from gl...
173
click to vote
CIE
2005
Springer
16 years 1 months ago
2005
Springer
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
184
click to vote
CONCUR
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. Reactive systems are often modelled as two person antagonistic games where one player represents the system while his adversary represents the environment. Undoubtedly, t...