96 search results - page 10 / 20 » On the Complexity of Deciding Avoidability of Sets of Partia... |
JAPLL
2007
13 years 7 months ago
2007
Many open domain question answering systems answer questions by first harvesting a large number of candidate answers, and then picking the most promising one from the list. One c...
JCS
2008
13 years 7 months ago
2008
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bound...
HICSS
2006
IEEE
14 years 1 months ago
2006
IEEE
Previous studies indicate that the expected effects of e-Government are slower to realize than initially expected. Several authors argue that e-Government involves particularly co...
JUCS
2006
13 years 7 months ago
2006
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
CONCUR
2007
Springer
14 years 1 months ago
2007
Springer
The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imp...