Sciweavers

102291 search results - page 20060 / 20459
» Computability in Computational Geometry
Sort
View
AI
2008
Springer
15 years 7 months ago
Modelling and solving temporal reasoning as propositional satisfiability
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
Duc Nghia Pham, John Thornton, Abdul Sattar
AI
2007
Springer
15 years 7 months ago
Learning, detection and representation of multi-agent events in videos
In this paper, we model multi-agent events in terms of a temporally varying sequence of sub-events, and propose a novel approach for learning, detecting and representing events in...
Asaad Hakeem, Mubarak Shah
AIEDU
2008
162views more  AIEDU 2008»
15 years 7 months ago
Designing Learning by Teaching Agents: The Betty's Brain System
The idea that teaching others is a powerful way to learn is intuitively compelling and supported in the research literature. We have developed computer-based, domain-independent Te...
Krittaya Leelawong, Gautam Biswas
ALGORITHMICA
2010
154views more  ALGORITHMICA 2010»
15 years 7 months ago
On the Convergence of Multicast Games in Directed Networks
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
Angelo Fanelli, Michele Flammini, Luca Moscardelli
169
Voted
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
15 years 7 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama
« Prev « First page 20060 / 20459 Last » Next »