Sciweavers

288 search results - page 49 / 58
» What's happening
Sort
View
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
13 years 9 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou
DAGSTUHL
2007
13 years 9 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
FOIS
2006
13 years 9 months ago
Against Idiosyncrasy in Ontology Development
The world of ontology development is full of mysteries. Recently, ISO Standard 15926 ("Lifecycle Integration of Process Plant Data Including Oil and Gas Production Facilities&...
Barry Smith
WSC
2000
13 years 9 months ago
Using simulation and critical points to define states in continuous search spaces
Many artificial intelligence techniques rely on the notion ate" as an abstraction of the actual state of the nd an "operator" as an abstraction of the actions that ...
Marc S. Atkin, Paul R. Cohen
AIEDU
2007
86views more  AIEDU 2007»
13 years 8 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