328 search results - page 27 / 66 » Simple Termination Revisited |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
GI
2005
Springer
14 years 1 months ago
2005
Springer
: It is well known that dynamic OFDMA systems potentially increase the spectral efficiency of wireless systems. They exploit diversity effects in time, space, and frequency by ass...
TIME
1997
IEEE
13 years 11 months ago
1997
IEEE
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, allows the derivation of the maximal validity intervals (MVIs) o...
PPDP
2007
Springer
14 years 1 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...