15033 search results - page 209 / 3007 » Complexity Theory and Algorithms |
144
click to vote
ASIAN
2006
Springer
15 years 8 months ago
2006
Springer
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
178
click to vote
FOSSACS
2001
Springer
15 years 9 months ago
2001
Springer
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
153
click to vote
FOIS
2006
15 years 5 months ago
2006
An ontology alignment is the expression of relations between different ontologies. In order to view alignments independently from the language expressing ontologies and from the te...
158
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
168
click to vote
WSC
1998
15 years 5 months ago
1998
A significant challenge in implementing the Theory of Constraints in the semiconductor industry is the complex and reentrant nature of the manufacturing process. Managing a constr...