16404 search results - page 469 / 3281 » A set coverage problem |
195
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— This paper analyzes two classes of consensus algorithms in presence of bounded measurement errors. The protocols taken into account adopt an updating rule based either on const...
153
click to vote
AE
2007
Springer
16 years 1 months ago
2007
Springer
The evaluation or fitness function is a key component of any heuristic search algorithm. This paper introduces a new evaluation function for the well-known graph K-coloring proble...
171
click to vote
ICCS
2007
Springer
16 years 29 days ago
2007
Springer
Abstract. This paper describes metaheuristic algorithm based on simulated annealing method,which is a nature-inspired method, to analyze and improve the efficiency of the design of...
165
click to vote
IJCNN
2006
IEEE
16 years 25 days ago
2006
IEEE
— One of the major drawbacks of the Hopfield network is that when it is applied to certain polytopes of combinatorial problems, such as the traveling salesman problem (TSP), the...
145
click to vote
FCT
2005
Springer
16 years 10 days ago
2005
Springer
In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of...