1263 search results - page 78 / 253 » A* with Bounded Costs |
153
click to vote
MP
2006
15 years 6 months ago
2006
We consider the vehicle routing problem where one can choose among vehicles with different costs and capacities to serve the trips. We develop six different formulations: the first...
141
click to vote
SIAMJO
2008
15 years 6 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
138
click to vote
TSP
2008
15 years 6 months ago
2008
We derive an easy-to-compute approximate bound for the range of step-sizes for which the constant-modulus algorithm (CMA) will remain stable if initialized close to a minimum of t...
133
click to vote
ICCD
2004
IEEE
16 years 3 months ago
2004
IEEE
In this paper we present a clustered, multiple-clock domain (CMCD) microarchitecture that combines the benefits of both clustering and Globally Asynchronous Locally Synchronous (G...
132
click to vote
COST
2009
Springer
16 years 23 days ago
2009
Springer
We propose a matching algorithm secure against the wolf attack in one-to-one biometric authentications. Our proposal algorithm first executes a one-to-all comparison using a conve...