Sciweavers

56 search results - page 10 / 12
» What Happened in CLEF 2007
Sort
View
DAGSTUHL
2007
14 years 11 months ago
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
Bodo Manthey, Till Tantau
IJCAI
1997
14 years 11 months ago
Reasoning about Concurrent Execution Prioritized Interrupts, and Exogenous Actions in the Situation Calculus
As an alternative to planning, an approach to highlevel agent control based on concurrent program execution is considered. A formal definition in the situation calculus of such a ...
Giuseppe De Giacomo, Yves Lespérance, Hecto...
BIS
2009
154views Business» more  BIS 2009»
14 years 11 months ago
Using Process Mining to Generate Accurate and Interactive Business Process Maps
Abstract. The quality of today's digital maps is very high. This allows for new functionality as illustrated by modern car navigation systems (e.g., TomTom, Garmin, etc.), Goo...
Wil M. P. van der Aalst
AIEDU
2007
86views more  AIEDU 2007»
14 years 10 months ago
A Study of Feedback Strategies in Foreign Language Classrooms and Tutorials with Implications for Intelligent Computer-Assisted
This paper presents two new corpus-based studies of feedback in the domain of teaching Spanish as a foreign language, concentrating on the type and frequency of different feedback ...
Anita Ferreira, Johanna D. Moore, Chris Mellish
AML
2005
101views more  AML 2005»
14 years 9 months ago
Forcing and antifoundation
It is proved that the forcing apparatus can be built and set to work in ZFCA (=ZFC minus foundation plus the antifoundation axiom AFA). The key tools for this construction are gre...
Athanassios Tzouvaras