Sciweavers

1054 search results - page 62 / 211
» A Formalization of the Turing Test
Sort
View
122
Voted
ITS
2010
Springer
169views Multimedia» more  ITS 2010»
15 years 9 months ago
Automatic Question Generation for Literature Review Writing Support
This paper presents a novel Automatic Question Generation (AQG) approach that generates trigger questions as a form of support for students’ learning through writing. The approac...
Ming Liu, Rafael A. Calvo, Vasile Rus
COCO
1999
Springer
101views Algorithms» more  COCO 1999»
15 years 8 months ago
A Lower Bound for Primality
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
Eric Allender, Michael E. Saks, Igor Shparlinski
129
Voted
ECOWS
2006
Springer
15 years 8 months ago
AMPol: Adaptive Messaging Policy
Interoperability in a large-scale distributed system is challenged by by the diversity of node policies. We introduce AMPol (Adaptive Messaging Policy), a serviceoriented architec...
Raja Afandi, Jianqing Zhang, Munawar Hafiz, Carl A...
TOH
2008
106views more  TOH 2008»
15 years 4 months ago
Physical Collaboration of Human-Human and Human-Robot Teams
Human partners working on a target acquisition task perform faster than do individuals on the same task, even though the partners consider each other to be an impediment. We record...
Kyle B. Reed, Michael A. Peshkin
DAM
1998
88views more  DAM 1998»
15 years 4 months ago
Neither Reading Few Bits Twice Nor Reading Illegally Helps Much
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
Stasys Jukna, Alexander A. Razborov