12825 search results - page 333 / 2565 » Improved PLSOM algorithm |
195
click to vote
ICPP
2005
IEEE
16 years 26 days ago
2005
IEEE
Structured P2P overlay networks based on a consistent hashing function have an aftermath load balance problem that needs to be dealt with. A load balancing method should take into...
224
click to vote
APPROX
2005
Springer
16 years 24 days ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
170
click to vote
ISAAC
2005
Springer
16 years 23 days ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
189
click to vote
PVM
2004
Springer
16 years 18 days ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
179
click to vote
STACS
2004
Springer
16 years 18 days ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...