2027 search results - page 62 / 406 » When is it best to best-respond |
106
click to vote
ICALP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
108
Voted
KES
2004
Springer
15 years 6 months ago
2004
Springer
There is now a huge amount of high quality photometric data available in the literature whose analysis is bound to play a fundamental role in studies of the formation and evolution...
107
click to vote
WABI
2004
Springer
15 years 6 months ago
2004
Springer
Computational heuristics are the primary methods for reconstruction of phylogenetic trees on large datasets. Most large-scale phylogenetic analyses produce numerous trees that are ...
SC
2003
ACM
15 years 6 months ago
2003
ACM
We investigate runtime strategies for data-intensive applications that involve generalized reductions on large, distributed datasets. Our set of strategies includes replicated fi...
136
click to vote
FSTTCS
2003
Springer
15 years 5 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...