Sciweavers

594 search results - page 31 / 119
» Heuristic Measures of Interestingness
Sort
View
CADE
2007
Springer
16 years 6 days ago
SRASS - A Semantic Relevance Axiom Selection System
This paper describes the design, implementation, and testing of a system for selecting necessary axioms from a large set also containing superfluous axioms, to obtain a proof of a...
Geoff Sutcliffe, Yury Puzis
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
15 years 1 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
HEURISTICS
2006
120views more  HEURISTICS 2006»
14 years 12 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»
15 years 5 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...
IPPS
1993
IEEE
15 years 4 months ago
Mapping to Reduce Contention in Multiprocessor Architectures
Reducingcommunicationoverheadhas been widely recognized as a requirement for achieving efficient mappings which substantially reduce the execution time of parallel algorithms. Th...
Loren Schwiebert, D. N. Jayasimha