583 search results - page 91 / 117 » Preferences in Answer Set Programming |
105
click to vote
FUIN
2010
14 years 12 months 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...
102
click to vote
ICALP
2010
Springer
15 years 3 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...
128
click to vote
CDC
2010
IEEE
14 years 8 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) ...
107
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
112
click to vote
CPAIOR
2009
Springer
15 years 8 months ago
2009
Springer
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...