16404 search results - page 368 / 3281 » A set coverage problem |
138
click to vote
APN
2011
Springer
14 years 8 months ago
2011
Springer
In prime event structures with binary conflicts (pes-bc)3 a branching cell [1] is a subset of events closed under downward causality and immediate conflict relations. This means ...
161
click to vote
ERSHOV
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We consider the problem of query containment for conjunctive queries with safe negation property. A necessary and sufficient condition for two queries to be in containmen...
138
click to vote
EOR
2007
15 years 5 months ago
2007
In this paper we present several heuristic algorithms and a cutting-plane algorithm for the Windy Rural Postman Problem. This problem contains a big number of important Arc Routin...
144
click to vote
IPSN
2010
Springer
15 years 12 months ago
2010
Springer
We consider the problem of selecting an optimal set of sensors, as determined, for example, by the predictive accuracy of the resulting sensor network. Given an underlying metric ...
182
click to vote
ADC
2003
Springer
15 years 10 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...