16093 search results - page 132 / 3219 » On the optimality of the neighbor-joining algorithm |
149
click to vote
TWC
2008
15 years 1 months ago
2008
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
A genetic algorithm has been developed in order to find the global minimum of platinum-palladium nanoalloy clusters. The effect of biasing the initial population and predating sp...
118
click to vote
ACMICEC
2003
ACM
15 years 7 months ago
2003
ACM
This paper presents new clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with piecewise linear demand/supply functions. We analyse the complexi...
132
click to vote
APPROX
2010
Springer
15 years 3 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
IPL
2007
15 years 1 months ago
2007
The MIN algorithm is an offline strategy for deciding which item to replace when writing a new item to a cache. Its optimality was first established by Mattson, Gecsei, Slutz, a...