1480 search results - page 188 / 296 » Ants can solve constraint satisfaction problems |
160
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
- Redundant via insertion is a good solution to reduce the yield loss by via failure. However, the existing methods are all post-layout optimizations that insert redundant via afte...
182
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
— Ergodic stochastic optimization (ESO) algorithms are proposed to solve resource allocation problems that involve a random state and where optimality criteria are expressed in t...
148
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
We consider the design of parametric curves from geometric constraints such as distance from lines or points and tangency to lines or circles. We solve the Hermite problem with su...
182
click to vote
CHARME
2003
Springer
15 years 11 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
187
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Over the last few years, more and more heuristic decision making techniques have been inspired by nature, e.g. evolutionary algorithms, ant colony optimisation and simulated annea...