1614 search results - page 120 / 323 » Breadth-First Heuristic Search |
166
click to vote
CRYPTO
2005
Springer
16 years 10 days ago
2005
Springer
In this paper we present a practical heuristic attack on the Ko, Lee et al. key exchange protocol introduced at Crypto 2000 [10]. One of the ideas behind our attack is using Dehorn...
191
click to vote
OR
2005
Springer
16 years 9 days ago
2005
Springer
In the open route version of the well-known vehicle routing problem, vehicles are not required to return to the depot; or if they are required, then they return by traveling the sa...
132
click to vote
ECAI
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. The basic decision-theoretic troubleshooting task is described in this paper. Dependency sets are defined for a better understanding of dependent actions. It is shown th...
177
click to vote
CCCG
2001
15 years 8 months ago
2001
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
182
click to vote
TODAES
2008
15 years 6 months ago
2008
A new efficient algorithm is derived for the minimal period retiming by formal manipulation. Contrary to all previous algorithms, which used binary search on a range of candidate ...