Sciweavers

846 search results - page 106 / 170
» On the Computational Complexity of Spatio-Temporal Logics
Sort
View
ERSA
2004
134views Hardware» more  ERSA 2004»
15 years 7 months ago
A High Performance Application Representation for Reconfigurable Systems
Modern reconfigurable computing systems feature powerful hybrid architectures with multiple microprocessor cores, large reconfigurable logic arrays and distributed memory hierarch...
Wenrui Gong, Gang Wang, Ryan Kastner
CMOT
1998
92views more  CMOT 1998»
15 years 5 months ago
SDML: A Multi-Agent Language for Organizational Modelling
A programming language which is optimized for modelling multi-agent interaction within articulated social structures such as organizations is described with several examples of it...
Scott Moss, Helen Gaylard, Steve Wallis, Bruce Edm...
DAC
2010
ACM
15 years 9 months ago
Electronic design automation for social networks
Online social networks are a growing internet phenomenon: they connect millions of individuals through sharing of common interests, political and religious views, careers, etc. So...
Andrew DeOrio, Valeria Bertacco
ENTCS
2002
77views more  ENTCS 2002»
15 years 6 months ago
Trivial Reals
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...
Rodney G. Downey, Denis R. Hirschfeldt, Andr&eacut...
AI
2008
Springer
15 years 6 months ago
What makes propositional abduction tractable
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
Gustav Nordh, Bruno Zanuttini