839 search results - page 105 / 168 » Answer Set Programming with Resources |
109
Voted
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
120
click to vote
FUIN
2010
15 years 29 days ago
2010
Given a set of taxa S and a complete set of quartet topologies Q over S, the problem of determining a phylogeny that satisfies the maximum number of topologies is called the Maxi...
125
Voted
ECIR
2004
Springer
15 years 3 months ago
2004
Springer
We simulate different architectures of a distributed Information Retrieval system on a very large Web collection, in order to work out the optimal setting for a particular set of r...
140
Voted
CDC
2010
IEEE
14 years 9 months ago
2010
IEEE
Given linear matrix inequalities (LMIs) L1 and L2 in the same number of variables it is natural to ask: (Q1) does one dominate the other, that is, does L1(X) 0 imply L2(X) 0? (Q2) ...
126
Voted
PLDI
2009
ACM
15 years 9 months ago
2009
ACM
Decentralized information flow control (DIFC) is a promising model for writing programs with powerful, end-to-end security guarantees. Current DIFC systems that run on commodity ...