Sciweavers

7988 search results - page 1249 / 1598
» A Useful Undecidable Theory
Sort
View
INFOCOM
2000
IEEE
15 years 11 months ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
CHI
2000
ACM
15 years 11 months ago
Does computer-generated speech manifest personality? an experimental test of similarity-attraction
This study examines whether people would interpret and respond to paralinguistic personality cues in computergenerated speech in the same way as they do human speech. Participants...
Clifford Nass, Kwan Min Lee
AGENTCL
2000
Springer
15 years 11 months ago
Semantics of Communicating Agents Based on Deduction and Abduction
Intelligent agents in the agent language 3APL are computational entities consisting of beliefs and goals which make up their mental state. In this paper, we integrate communicatio...
Koen V. Hindriks, Frank S. de Boer, Wiebe van der ...
CIKM
2000
Springer
15 years 11 months ago
Boosting for Document Routing
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
Raj D. Iyer, David D. Lewis, Robert E. Schapire, Y...
DIAGRAMS
2000
Springer
15 years 11 months ago
Capacity Limits in Diagrammatic Reasoning
This paper examines capacity limits in mental animation of static diagrams of mechanical systems and interprets these limits within current theories of working memory. I review emp...
Mary Hegarty
« Prev « First page 1249 / 1598 Last » Next »