150 search results - page 16 / 30 » Counting Results in Weak Formalisms |
FORMATS
2008
Springer
13 years 10 months ago
2008
Springer
Time dependant models have been intensively studied for many reasons, among others because of their applications in software verification and due to the development of embedded pla...
FUIN
2006
13 years 8 months ago
2006
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
TCS
2010
13 years 7 months ago
2010
Robustness, the ability to analyze any input regardless of its grammaticality, is a desirable property for any system dealing with unrestricted natural language text. Error-repair...
HICSS
2005
IEEE
14 years 2 months ago
2005
IEEE
This paper presents the results of a genre analysis of two web-based collaborative authoring environments, Wikipedia and Everything2, both of which are intended as repositories of...
DEXAW
2000
IEEE
14 years 1 months ago
2000
IEEE
Given their simple nature, the success of keyword based retrieval systems is astonishing. Although these methods seemingly only process words (and their word counts), they rely on...