159 search results - page 16 / 32 » Computing minimum cuts by randomized search heuristics |
99
Voted
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
91
Voted
MDM
2009
Springer
15 years 7 months ago
2009
Springer
Abstract—Flash disks have been an emerging secondary storage media. In particular, there have been portable devices, multimedia players and laptop computers that are configured ...
109
Voted
VLSID
2005
IEEE
15 years 6 months ago
2005
IEEE
During pseudorandom testing, a significant amount of energy and test application time is wasted for generating and for applying “useless” test vectors that do not contribute t...
89
Voted
ISCAS
2005
IEEE
15 years 6 months ago
2005
IEEE
— A computation-aware motion estimation algorithm is proposed in this paper. Its goal is to find the best block matching results in a computation-limited and computation-variant...
103
Voted
MP
1998
15 years 2 days ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...