11716 search results - page 14 / 2344 » Computable symbolic dynamics |
PPOPP
1999
ACM
14 years 1 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
A new model of Genetic Programming with variable size population is presented in this paper and applied to the reconstruction of target functions in dynamic environments (i.e. pro...
EUROPAR
2007
Springer
14 years 3 months ago
2007
Springer
This paper introduces the design of SymGrid, a new Grid framework that will, for the first time, allow multiple invocations of symbolic computing applications to interact via the ...
CSFW
2011
IEEE
12 years 9 months ago
2011
IEEE
—We propose a much-needed formal definition of security for cryptographic key management APIs. The advantages of our definition are that it is general, intuitive, and applicabl...
ICPR
2006
IEEE
14 years 10 months ago
2006
IEEE
In this paper we present an innovative approach to automatically generate adjacency grammars describing graphical symbols. A grammar production is formulated in terms of rulesets ...