6833 search results - page 47 / 1367 » Some two-character sets |
173
click to vote
AAIM
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
128
click to vote
AUTOMATICA
2008
15 years 5 months ago
2008
This paper is concerned with obtaining necessary and sufficient conditions for fulfilling specified state and control pointwise-in-time constraints against a certain class of nonli...
138
click to vote
VLDB
2005
ACM
15 years 11 months ago
2005
ACM
XML and XQuery semantics are very sensitive to the order of the produced output. Although pattern-tree based algebraic approaches are becoming more and more popular for evaluating...
169
click to vote
EWNLG
1993
15 years 9 months ago
1993
Abstract. An active research programme in Natural Language Generation has grown up around the notion of `coherence relations'. Relations are being used in a variety of roles i...
152
click to vote
CSC
2008
15 years 7 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...