71228 search results - page 84 / 14246 » Algorithms |
125
click to vote
CIMCA
2008
IEEE
15 years 3 months ago
2008
IEEE
This paper analyses the advantages and disadvantages of the K-means algorithm and the DENCLUE algorithm. In order to realise the automation of clustering analysis and eliminate hu...
127
click to vote
FAW
2008
Springer
15 years 3 months ago
2008
Springer
constraint bipartite vertex cover is a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized ...
128
click to vote
NIPS
2001
15 years 2 months ago
2001
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
110
click to vote
ENTCS
2008
15 years 1 months ago
2008
This paper introduces a new algorithm dedicated to the rigorous reachability analysis of nonlinear dynamical systems. The algorithm is initially presented in the context of discre...
136
click to vote
INFORMATICALT
2000
15 years 1 months ago
2000
Many heuristics, such as simulated annealing, genetic algorithms, greedy randomized adaptive search procedures are stochastic. In this paper, we propose a deterministic heuristic a...