1528 search results - page 244 / 306 » Performance Assertion Checking |
CSC
2008
13 years 9 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
LREC
2010
13 years 9 months ago
2010
We present CAVaT, a tool that performs Corpus Analysis and Validation for TimeML. CAVaT is an open source, modular checking utility for statistical analysis of features specific t...
LREC
2010
13 years 9 months ago
2010
We propose a Word Sense Disambiguation (WSD) method that accurately classifies ambiguous words to concepts in the Associative Concept Dictionary (ACD) even when the test corpus an...
FORTE
2008
13 years 9 months ago
2008
In software engineering, graphical formalisms, like state-transition tables and automata, are very often indispensable parts of the specifications. Such a formalism usually leads t...
ICWS
2007
IEEE
13 years 9 months ago
2007
IEEE
Workflows often operate in volatile environments in which the component services’ QoS changes frequently. Optimally adapting to these changes becomes an important problem that ...