4137 search results - page 332 / 828 » On the number of matchings of a tree |
180
click to vote
PCI
2005
Springer
16 years 10 days ago
2005
Springer
Bioinformatics applications are one of the most relevant and compute-demanding applications today. While normally these applications are executed on clusters or dedicated parallel ...
184
click to vote
PPSN
2004
Springer
16 years 6 days ago
2004
Springer
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
175
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
169
click to vote
AAAI
1994
15 years 8 months ago
1994
Conceptual information retrieval systems use structured document indices, domain knowledge and a set of heuristic retrieval strategies to match user queries with a set of indices ...
148
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...