1157 search results - page 216 / 232 » Descriptive Complexity and Model Checking |
BIRTHDAY
2010
Springer
13 years 9 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
MMB
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
WSC
1998
13 years 10 months ago
1998
MODSIM II is an object-oriented discrete event simulation language featuring extensive run-time libraries, graphical user interface and results presentation tools, database access...
BMCBI
2010
13 years 3 months ago
2010
Background: The correlation between the expression levels of transcription factors and their target genes can be used to infer interactions within animal regulatory networks, but ...
CHI
2007
ACM
14 years 9 months ago
2007
ACM
In order to develop intelligent systems that attain the trust of their users, it is important to understand how users perceive such systems and develop those perceptions over time...