Sciweavers

4372 search results - page 97 / 875
» Algorithmic Theories of Everything
Sort
View
CORR
2000
Springer
116views Education» more  CORR 2000»
13 years 8 months ago
Algorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
Péter Gács, John Tromp, Paul M. B. V...
IFIP
2010
Springer
13 years 3 months ago
Efficient Decision Procedures for Message Deducibility and Static Equivalence
Abstract. We consider two standard notions in formal security protocol analysis: message deducibility and static equivalence under equational theories. We present polynomial-time a...
Bruno Conchinha, David A. Basin, Carlos Caleiro
ENTCS
2008
108views more  ENTCS 2008»
13 years 8 months ago
E-matching for Fun and Profit
Efficient handling of quantifiers is crucial for solving software verification problems. E-matching algorithms are used in satisfiability modulo theories solvers that handle quant...
Michal Moskal, Jakub Lopuszanski, Joseph R. Kiniry
GECCO
2006
Springer
174views Optimization» more  GECCO 2006»
14 years 14 days ago
On the analysis of the (1+1) memetic algorithm
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...
Dirk Sudholt
AMC
2008
87views more  AMC 2008»
13 years 9 months ago
Mining classification rules with Reduced MEPAR-miner Algorithm
In this study, a new classification technique based on rough set theory and MEPAR-miner algorithm for association rule mining is introduced. Proposed method is called as `Reduced ...
Emel Kizilkaya Aydogan, Cevriye Gencer