3359 search results - page 125 / 672 » A Simplified Idea Algorithm |
149
click to vote
SAC
2011
ACM
14 years 5 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
238
click to vote
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
135
Voted
TAMC
2009
Springer
15 years 9 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
124
Voted
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper describes a scalable parallel marking technique for garbage collection that does not employ any synchronization operation. To achieve good scalability, two major design...
108
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
A new mutation concept is proposed to generalize local selection based Differential Evolution algorithm to work in general multimodal problems. Three variations of the proposed me...