Sciweavers

608 search results - page 11 / 122
» The Expressive Power of Simple Parallelism
Sort
View
CONCUR
2007
Springer
15 years 3 months ago
Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
Abstract. We consider linear time temporal logic enriched with semiextended regular expressions through various operators that have been proposed in the literature, in particular i...
Martin Lange
80
Voted
SC
1994
ACM
15 years 1 months ago
The range test: a dependence test for symbolic, non-linear expressions
Most current data dependence tests cannot handle loop bounds or array subscripts that are symbolic, nonlinear expressions e.g. Ani+j, where 0 j n. In this paper, we describe a d...
William Blume, Rudolf Eigenmann
CONCUR
2010
Springer
14 years 10 months ago
Mean-Payoff Automaton Expressions
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
Krishnendu Chatterjee, Laurent Doyen, Herbert Edel...
64
Voted
IWINAC
2005
Springer
15 years 3 months ago
Parallel Evolutionary Computation: Application of an EA to Controller Design
The evolutionary algorithms can be considered as a powerful and interesting technique for solving large kinds of control problems. However, the great disadvantage of the evolutiona...
Manuel Parrilla Sánchez, Joaquín Ara...
ECAI
2010
Springer
14 years 10 months ago
Nested Monte-Carlo Expression Discovery
Nested Monte-Carlo search is a general algorithm that gives good results in single player games. Genetic Programming evaluates and combines trees to discover expressions that maxim...
Tristan Cazenave