1182 search results - page 109 / 237 » Iterative Methods in Combinatorial Optimization |
161
click to vote
ICDCS
1997
IEEE
15 years 7 months ago
1997
IEEE
Two novel suboptimal algorithms for mutual exclusion in distributed systems are presented. One is based on the modi cation of Maekawa's grid based quorum scheme. The size of ...
143
click to vote
SODA
2001
ACM
15 years 4 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
171
click to vote
NCA
2008
IEEE
15 years 3 months ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
111
click to vote
AI
1998
Springer
15 years 2 months ago
1998
Springer
This paper introduces a niching technique called GAS (S stands for species) which dynamically creates a subpopulation structure (taxonomic chart) using a radius function instead of...
139
click to vote
SASN
2006
ACM
15 years 9 months ago
2006
ACM
Key predistribution in wireless sensor networks refers to the problem of distributing secret keys among sensors prior to deployment. Solutions appeared in the literature can be cl...