14382 search results - page 29 / 2877 » Time in Connectionist Models |
AAAI
1993
14 years 11 months ago
1993
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
ASPDAC
2012
ACM
13 years 5 months ago
2012
ACM
—Host-compiled simulation has been widely adopted as a practical approach for fast and high-level evaluation of complex software-intensive systems at early stages of the design p...
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
In this paper4 , we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly in...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—It is challenging to provide authentication to timecritical multicast data, where low end-to-end delay is of crucial importance. Consequently, it requires not only effi...
ATVA
2006
Springer
15 years 1 months ago
2006
Springer
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...