6562 search results - page 108 / 1313 » Noetherianity and Combination Problems |
139
click to vote
LION
2007
Springer
15 years 10 months ago
2007
Springer
The problem of finding the broadcast scheme with minimum power consumption in a wireless ad-hoc network is NP-hard. This work presents a new hybrid algorithm to solve this problem...
141
click to vote
ICNC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
166
click to vote
ANTSW
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
142
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
137
click to vote
MOC
2000
15 years 4 months ago
2000
We treat the time discretization of an initial-value problem for a ous abstract parabolic equation by first using a representation of the solution as an integral along the boundary...