Sciweavers

32 search results - page 2 / 7
» The Strength of the Besicovitch-Davies Theorem
Sort
View
EC
1998
134views ECommerce» more  EC 1998»
13 years 5 months ago
Schema Theory for Genetic Programming with One-Point Crossover and Point Mutation
In this paper we first review the main results obtained in the theory of schemata in Genetic Programming (GP) emphasising their strengths and weaknesses. Then we propose a new, s...
Riccardo Poli, William B. Langdon
AAAI
2000
13 years 6 months ago
The Game of Hex: An Automatic Theorem Proving Approach to Game Programming
The game of Hex is a two-player game with simple rules, a deep underlying mathematical beauty, and a strategic complexity comparable to that of Chess and Go. The massive game-tree...
Vadim V. Anshelevich
MLQ
2006
84views more  MLQ 2006»
13 years 5 months ago
A note on Bar Induction in Constructive Set Theory
Bar Induction occupies a central place in Brouwerian mathematics. This note is concerned with the strength of Bar Induction on the basis of Constructive ZermeloFraenkel Set Theory...
Michael Rathjen
CADE
2006
Springer
14 years 5 months ago
On the Strength of Proof-Irrelevant Type Theories
We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlyi...
Benjamin Werner
DAM
2010
116views more  DAM 2010»
13 years 5 months ago
Minimum sum edge colorings of multicycles
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
Jean Cardinal, Vlady Ravelomanana, Mario Valencia-...