635 search results - page 41 / 127 » Some Computational Problems Related to Pseudo-intents |
135
Voted
ALGORITHMICA
2011
14 years 4 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
JCS
2008
14 years 9 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...
ITICSE
2006
ACM
15 years 3 months ago
2006
ACM
We report on a study of novice programmers’ object oriented class designs. These designs were analysed to discover what faults they displayed. The two most common faults related...
DSRT
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper describes the addition of an extra piece of software, a rollback manager, to implement state saving and rollback management for optimistic federates in the High Level A...
PODS
1999
ACM
15 years 2 months ago
1999
ACM
In this paper we consider the problem of the logical characterization of the notion of consistent answer in a relational database that may violate given integrity constraints. Thi...