8728 search results - page 338 / 1746 » On Reduct Construction Algorithms |
266
click to vote
TELSYS
2011
15 years 1 months ago
2011
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...
147
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...
175
Voted
WAN
1998
Springer
15 years 11 months ago
1998
Springer
We consider parallel algorithms for computing the Hermite normal form of matrices over Euclidean rings. We use standard types of reduction methods which are the basis of many algor...
167
click to vote
ACIVS
2008
Springer
16 years 1 months ago
2008
Springer
The paper proposes a new parallel connected-component-tree construction algorithm based on line independent building and progressive merging of partial 1-D trees. Two parallelizati...
181
click to vote
WEA
2005
Springer
16 years 6 days ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...