12950 search results - page 524 / 2590 » On Optimal Timed Strategies |
181
click to vote
GECCO
2005
Springer
16 years 21 days ago
2005
Springer
In this paper, a novel variant of particle swarm optimization (PSO), named memetic particle swarm optimization algorithm (MeSwarm), is proposed for tackling the overshooting probl...
174
click to vote
SIAMCOMP
2008
15 years 7 months ago
2008
We give an algorithm requiring O(c1/2 n) time to find an -optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgele...
189
click to vote
JACM
2010
15 years 5 months ago
2010
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic f...
182
click to vote
TCS
2011
15 years 2 months ago
2011
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three ...
200
click to vote
CVPR
2005
IEEE
16 years 9 months ago
2005
IEEE
With the limited field of view of human vision, our perception of most scenes is built over time while our eyes are scanning the scene. In the case of static scenes this process c...