11565 search results - page 39 / 2313 » Computing Minimal Mappings |
138
Voted
CAP
2010
14 years 10 months ago
2010
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
124
Voted
CIAC
2010
Springer
16 years 29 days ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
132
Voted
SODA
1992
ACM
15 years 4 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
115
Voted
AAAI
2008
15 years 6 months ago
2008
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...
124
Voted
JSC
2000
15 years 3 months ago
2000
The orbits of a minimal parabolic k-subgroup acting on a symmetric k-variety are essential to the study of symmetric k-varieties and their representations. This paper gives an algo...