Sciweavers

1418 search results - page 33 / 284
» How to Explain Mistakes
Sort
View
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 8 months ago
Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas
Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks wit...
Peter Sanders
ENTCS
2008
65views more  ENTCS 2008»
13 years 8 months ago
Rules and Strategies in Java
In this paper we present the essential feature we have considered when designing a new language based on rules and strategies. Relying on the implementation of Tom, we explain how...
Pierre-Etienne Moreau, Antoine Reilles
JOT
2007
87views more  JOT 2007»
13 years 8 months ago
Persistent Processes and Distribution in Timor
The paper explains the concept of persistent processes and threads in Timor, showing how it is based on the in-process (procedure oriented) model of process execution. In their Ti...
James Leslie Keedy, Klaus Espenlaub, Christian Hei...
CSL
2002
Springer
13 years 8 months ago
Designs, Disputes and Strategies
Ludics has been proposed by Girard as an abstract general approach to proof theory. We explain how its basic notions correspond to those of the "innocent strategy" apprao...
Claudia Faggian, Martin Hyland
COGSCI
2004
148views more  COGSCI 2004»
13 years 8 months ago
Disfluencies, language comprehension, and Tree Adjoining Grammars
Disfluencies include editing terms such as uh and um as well as repeats and revisions. Little is known about how disfluencies are processed, and there has been next to no research...
Fernanda Ferreira, Ellen F. Lau, Karl G. D. Bailey