Sciweavers

1054 search results - page 101 / 211
» A Formalization of the Turing Test
Sort
View
JCS
2008
109views more  JCS 2008»
15 years 6 months ago
Secrecy for bounded security protocols with freshness check is NEXPTIME-complete
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...
Ferucio Laurentiu Tiplea, Catalin V. Birjoveanu, C...
AADEBUG
1995
Springer
15 years 10 months ago
Software Testability Measurement for Assertion Placement and Fault Localization
Software testability, the tendency for software to reveal its faults during testing, is an important issue for veri cation and quality assurance. Testability measurement can also b...
Jeffrey M. Voas
ICCS
2005
Springer
15 years 12 months ago
The Dynamics of Computing Agent Systems
The paper presents the Multi Agent System (MAS) designed for the large scale parallel computations. The special kind of diffusionbased scheduling enables to decompose and allocate...
Maciej Smolka, Piotr Uhruski, Robert Schaefer, Mar...
JMLR
2012
13 years 8 months ago
Structured Output Learning with High Order Loss Functions
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
Daniel Tarlow, Richard S. Zemel
UML
2005
Springer
15 years 12 months ago
Specifying Precise Use Cases with Use Case Charts
Use cases are a popular method for capturing and structuring software requirements. The informality of use cases is both a blessing and a curse. It enables easy application and lea...
Jon Whittle