361 search results - page 32 / 73 » Maximum subset intersection |
86
Voted
AAAI
2007
15 years 4 months ago
2007
The main focus in the area of action languages, such as GOLOG, was put on expressive power, while the development in the area of action planning was focused on efficient plan gen...
102
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
In an undirected graph G = (V, E), a subset C V such that C is a dominating set of G, and each vertex in V is dominated by a distinct subset of vertices from C, is called an iden...
125
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
102
click to vote
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
100
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...