4767 search results - page 540 / 954 » Structures for Abstract Rewriting |
183
click to vote
FROCOS
2007
Springer
16 years 1 months ago
2007
Springer
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly ascending chains of congruences. In this paper, we adapt this notion to first-ord...
176
Voted
FSEN
2007
Springer
16 years 1 months ago
2007
Springer
This paper shows how a machine-code Hoare logic is used to lift reasoning from the tedious operational model of a machine lana manageable level of abstraction without making simpli...
141
Voted
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
In this paper, we describe a new algorithm that consists in combining an eye-tracker for minimizing the fatigue of a user during the evaluation process of Interactive Evolutionary...
183
Voted
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism and probabilities. Here, we show ...
165
click to vote
ISNN
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Compared to normal learning algorithms, for example backpropagation, the optimal bounded ellipsoid (OBE) algorithm has some better properties, such as faster convergence,...