Sciweavers

1123 search results - page 212 / 225
» Network Protocol System Fingerprinting - A Formal Approach
Sort
View
BIRTHDAY
2005
Springer
15 years 5 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau
SAC
2004
ACM
15 years 5 months ago
Combining analysis and synthesis in a model of a biological cell
for ideas, and then abstract away from these ideas to produce algorithmic processes that can create problem solutions in a bottom-up manner. We have previously described a top-dow...
Ken Webb, Tony White
DIM
2008
ACM
15 years 1 months ago
Minimal information disclosure with efficiently verifiable credentials
Public-key based certificates provide a standard way to prove one's identity, as attested by some certificate authority (CA). However, plain certificates provide a binary ide...
David Bauer, Douglas M. Blough, David Cash
RSA
2000
170views more  RSA 2000»
14 years 11 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski
RE
1997
Springer
15 years 3 months ago
Requirements Models in Context
The field of requirements engineering emerges out of tradition of research and engineering practice that stresses rtance of generalizations and abstractions. abstraction is essent...
Colin Potts