603 search results - page 22 / 121 » DFS-Tree Based Heuristic Search |
CRYPTO
2005
Springer
14 years 1 months 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...
COR
2004
13 years 7 months ago
2004
The routing of a fleet of vehicles to service a set of customers is important in the field of distribution. Vehicle Routing Problems (VRP) arise in many real-life applications wit...
EVOW
2007
Springer
14 years 2 months ago
2007
Springer
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— Future communication networks should be designed with the consideration of efficiently supporting intensive multicast applications. Network coding technique proposed recently ...
PPSN
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...