2517 search results - page 44 / 504 » Specifying Weak Sets |
105
click to vote
EVOW
2000
Springer
15 years 3 months ago
2000
Springer
This paper presents an investigation into the classification of a difficult data set containing large intra-class variability but low inter-class variability. Standard classifiers...
CONCUR
1995
Springer
15 years 3 months ago
1995
Springer
Abstract. We exploit a notion of interface for Petri nets in order to design a set of net combinators. For such a calculus of nets, we focus on the behavioural congruences arising ...
MPC
1998
Springer
15 years 4 months ago
1998
Springer
Timed-trace formalisms have emerged as a powerful method for specifying and reasoning about concurrent real-time systems. We present a simple variant which builds methodically on s...
CAL
2006
14 years 12 months ago
2006
Abstract-- Transactional memory has great potential for simplifying multithreaded programming by allowing programmers to specify regions of the program that must appear to execute ...
107
click to vote
MSS
2008
IEEE
14 years 11 months ago
2008
IEEE
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset...