Sciweavers

6355 search results - page 210 / 1271
» From Logic to Games
Sort
View
GECCO
2005
Springer
196views Optimization» more  GECCO 2005»
16 years 3 days ago
Providing information from the environment for growing electronic circuits through polymorphic gates
This paper deals with the evolutionary design of programs (constructors) that are able to create (n+2)-input circuits from n-input circuits. The growing circuits are composed of p...
Michal Bidlo, Lukás Sekanina
CORR
2011
Springer
199views Education» more  CORR 2011»
15 years 1 months ago
From Machine Learning to Machine Reasoning
A plausible definition of "reasoning" could be "algebraically manipulating previously acquired knowledge in order to answer a new question". This definition co...
Léon Bottou
STACS
1999
Springer
15 years 10 months ago
In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?
Abstract. In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2Ckn1/(k−2) low...
Mario Szegedy
SLOGICA
2011
15 years 1 months ago
Logics for Qualitative Inductive Generalization
The paper contains a survey of (mainly unpublished) adaptive logics of inductive generalization. These defeasible logics are precise formulations of certain methods. Some attentio...
Diderik Batens
CONCUR
2005
Springer
16 years 3 days ago
A New Modality for Almost Everywhere Properties in Timed Automata
The context of this study is timed temporal logics for timed automata. In this paper, we propose an extension of the classical logic TCTL with a new Until modality, called “Until...
Houda Bel Mokadem, Béatrice Bérard, ...