1146 search results - page 158 / 230 » Finite cupping sets |
SOCA
2008
IEEE
13 years 10 months ago
2008
IEEE
Specification, modeling and analysis of interactions among peers that communicate via messages are becoming increasingly important due to the emergence of service oriented computi...
LOGCOM
2007
13 years 10 months ago
2007
The syntactic approach to epistemic logic avoids the logical omniscience problem by taking knowledge as primary rather than as defined in terms of possible worlds. In this study, ...
SIAMCOMP
2000
13 years 10 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
SIAMCO
2002
13 years 9 months ago
2002
Abstract. We consider feasible sets given by conic constraints, where the cone defining the constraints is convex with nonempty interior. We study the case where the feasible set i...
ISAAC
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...