Sciweavers

1639 search results - page 124 / 328
» Anytime Heuristic Search
Sort
View
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
13 years 11 months ago
On contract-and-refine transformations between phylogenetic trees
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy ...
HEURISTICS
2006
120views more  HEURISTICS 2006»
13 years 10 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet
CRYPTO
2005
Springer
83views Cryptology» more  CRYPTO 2005»
14 years 3 months ago
A Practical Attack on a Braid Group Based Cryptographic Protocol
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...
Alexei G. Myasnikov, Vladimir Shpilrain, Alexander...
OR
2005
Springer
14 years 3 months ago
Open Vehicle Routing Problem with Time Deadlines: Solution Methods and an Application
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...
Zeynep Özyurt, Deniz Aksen, Necati Aras
ECAI
2004
Springer
14 years 3 months ago
A Troubleshooting Approach with Dependent Actions
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...
Eylem Koca, Taner Bilgiç