1272 search results - page 127 / 255 » The Set Cover with Pairs Problem |
COR
2007
13 years 10 months ago
2007
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
JGAA
2006
13 years 10 months ago
2006
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...
ICASSP
2010
IEEE
13 years 9 months ago
2010
IEEE
We design lifting-based wavelet transforms for any arbitrary communication graph in a wireless sensor network (WSN). Since transmitting raw data bits along the routing trees in WS...
RR
2010
Springer
13 years 9 months ago
2010
Springer
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog r...
ECAI
2004
Springer
14 years 4 months ago
2004
Springer
TCP-nets are an extension of CP-nets which allow the expression of conditional relative importance of pairs of variables. In this paper it is shown that a simple logic of condition...