4047 search results - page 3 / 810 » Some Properties and Some Problems on Set Functors |
APSEC
2000
IEEE
13 years 9 months ago
2000
IEEE
It has been recognised that formal methods are useful as a modelling tool in requirements engineering. Specification languages such as Z permit the precise and unambiguous modell...
ISIPTA
2003
IEEE
13 years 10 months ago
2003
IEEE
Based on the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence), we adopt a probabilistic approach to uncertainty based on conditional p...
IWOCA
2010
Springer
12 years 11 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
COMBINATORICS
2006
13 years 4 months ago
2006
We present both probabilistic and constructive lower bounds on the maximum size of a set of points S Rd such that every angle determined by three points in S is acute, considerin...
CTCS
1987
Springer
13 years 8 months ago
1987
Springer
of this paper is to prevent the abstract data type researcher from an improper, naive use of category theory. We mainly emphasize some unpleasant properties of the synthesis funct...