Sciweavers

199 search results - page 38 / 40
» Adequate formalization
Sort
View
IJCAI
1993
13 years 8 months ago
A Model-Theoretic Approach to the Verification of Situated Reasoning Systems
agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the prac...
Anand S. Rao, Michael P. Georgeff
CIDR
2009
119views Algorithms» more  CIDR 2009»
13 years 8 months ago
DBMSs Should Talk Back Too
Natural language user interfaces to database systems have been studied for several decades now. They have mainly focused on parsing and interpreting natural language queries to ge...
Alkis Simitsis, Yannis E. Ioannidis
BMCBI
2008
80views more  BMCBI 2008»
13 years 7 months ago
Towards an automatic classification of protein structural domains based on structural similarity
Background: Formal classification of a large collection of protein structures aids the understanding of evolutionary relationships among them. Classifications involving manual ste...
Vichetra Sam, Chin-Hsien Tai, Jean Garnier, Jean-F...
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 7 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
INFOCOM
2010
IEEE
13 years 7 months ago
Walking in Facebook: A Case Study of Unbiased Sampling of OSNs
With more than 250 million active users, Facebook (FB) is currently one of the most important online social networks. Our goal in this paper is to obtain a representative (unbiased...
Minas Gjoka, Maciej Kurant, Carter T. Butts, Athin...